Skip to main content

Defining decision rules in signed horn clauses

  • Knowledge Representation
  • Conference paper
  • First Online:
  • 153 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1303))

Abstract

Making decisions is one of the central problems in knowledge based and expert systems. It is in particular a fundamental issue of Distributed AI. In this paper we define some well-known, rather simple rules from decision theory within a framework of many-valued logic programming. We show how these rules can also be generalized using partially ordered preference functions and how they can apply to multi-agent systems.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. D. Belnap. A useful four-valued Logic. J.M. Dunn and G. epstein (Hrsg.). Modern Uses of Multiple-valued Logics, 8–37. Reidel, 1977.

    Google Scholar 

  2. B. A. Davey, H.A. Priestley. Introduction to lattices and order. Cambridge University Press, 1994.

    Google Scholar 

  3. D. Dubois, H. Prade. Approximate and Commonsense reasoning: From Theory to Practice. Proceedings of the 9th International Symposium ISMIS 96. LNAI 1079, Springer, 1996.

    Google Scholar 

  4. M.Fitting. Bilattices and the semantics of logic programming. J. Logic Programming 11 (2), 91–116, 1991.

    Google Scholar 

  5. S. French. Decision Theory: An Introduction to the Mathematics of rationality. Ellis Horwood Limited, John Wiley & Sons, 1986.

    Google Scholar 

  6. M.Ginsberg. Multivalued logics. Computational Intelligence 4(3), 1988.

    Google Scholar 

  7. M.Ginsberg. Bilattices and modal operators. J. Logic and Computation, 1991.

    Google Scholar 

  8. R.Hähnle. Automated deduction in multiple-valued logics, International series of monographs on computer science 10. Oxford science publications, 1992.

    Google Scholar 

  9. R.Hähnle. Exploiting Data Dependencies in Many-Valued Logics. Journal of Applied Non-Classical Logics, Vol 6, Number 1, 49–69, 1996.

    Google Scholar 

  10. Michael Kifer, V.S. Subrahmanian. Theory of Generalized Annotated Logic Programming and its Applications. Journal of Logic Programming 1992:12:335–367.

    Google Scholar 

  11. J.J. Lu. Logic Programming with Signs and Annotations. Journal of Logic and Computation, Vol. 6, No 6, Oxford Univ. Press, Dec 1996.

    Google Scholar 

  12. S.M.Leach, J.J.Lu. Computing Annotated Logic. Proceedings of the Eleventh International Conference on Logic Programming. MIT Press, Massachusetts, 257–271, 1994.

    Google Scholar 

  13. J.J. Lu, N.M. Murray, E. Rosenthal. Signed Formulas and Annotated Logics. Proceedings of the 23th International Symposium on Multiple-valued Logics 1993, 48–53.

    Google Scholar 

  14. J.J. Lu, A. Nerode, V.S. Subrahmanian. Hybrid Knowledge Bases. To appear in IEEE Transactions on Knowledge and Data Engineering.

    Google Scholar 

  15. B. Messing. REGULA: Knowledge Representation and Processing in Many-valued Logics. Research Report No 320 of the Institut für Angewandte Informatik und Formale Beschreibungsverfahren, University of Karlsruhe

    Google Scholar 

  16. B. Messing. Darstellung und Integration von Wissen in verbandsbasierten signierten Logikprogrammen (in german). DISKI 132, infix-Verlag, St. Augustin, 1996.

    Google Scholar 

  17. Messing, B. Combining Knowledge with Many-Valued Logics. To appear in: Data & Knowledge Engineering.

    Google Scholar 

  18. B. Mobasher, D. Pigozzi, G. Slutzki. Multi-valued Logic Programming Semantics: An Algebraic Approach. Theoretical Computer Science 171 (1-2):77–109, 1997.

    Google Scholar 

  19. N.M. Murray, E. Rosenthal. Signed formulas: A liftable Meta-Logic for Multiple-Valued Logic. Proc. of the International Symposium on Methodologies for Intelligent Systems. Springer, 275–284, 1993.

    Google Scholar 

  20. J.J. Lu, N.M. Murray, E. Rosenthal. A Framework for Automated Reasoning in Multiple Valued Logics. To appear in Journal of Automated Reasoning.

    Google Scholar 

  21. J. Rosenschein, G. Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation among Agents. MIT press, 1994.

    Google Scholar 

  22. Saliger, E. Betriebswirtschaftliche Entscheidungstheorie. R. Oldenbourg Verlag, München, Wien, 1993.

    Google Scholar 

  23. V.S. Subrahmanian, S. Adali, A. Brink, R. Emery, J.J Lu, A. Rajput, T. Rogers, R. Ross, C. Ward. HERMES: A Heterogeneous reasoning and Mediator System. Draft manuscript (URL: http://www.cs.umd.edu/projects[hermes/index.htmi).

    Google Scholar 

  24. V.S. Subrahmanian. Amalgamating Knowledge Bases. ACM Transactions on Database Systems, 19 (2), 291–331, 1994.

    Google Scholar 

  25. G. Wiederhold. Mediators in the Architecture of Future Information Systems. IEEE Computer, 38–49, March 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerhard Brewka Christopher Habel Bernhard Nebel

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Messing, B. (1997). Defining decision rules in signed horn clauses. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_14

Download citation

  • DOI: https://doi.org/10.1007/3540634932_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63493-5

  • Online ISBN: 978-3-540-69582-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics