Skip to main content
SpringerLink
Log in
Book cover

Handbook of Philosophical Logic pp 1–85Cite as

Knowledge Representation with Logic Programs

  • Chapter

Part of the book series: Handbook of Philosophical Logic ((HALO,volume 12))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Jose Julio Alferes and Luiz Moniz Pereira. An argumentation theoretic semantics based on non-refutable falsity. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 3–22. Springer, Berlin, 1995.

    Google Scholar 

  2. Jose Julio Alferes and Luiz Moniz Pereira, editors. Reasoning with Logic Programming, LNAI 1111, Berlin, 1996. Springer.

    Google Scholar 

  3. [Alferes et al., 1996]_Jose Julio Alferes, Luiz Moniz Pereira, and Teodor Przymusinski. Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. In J.J Alferes, L.M. Pereira, and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA’ 96), LNCS 1126, pages 143–163. Springer, 1996.

    Google Scholar 

  4. Krzysztof R. Apt and Howard A. Blair. Arithmetic Classification of perfect Models of stratified Programs. Fundamenta Informaticae, XIII:1–17, 1990. Addendum in Vol. XIV, pages 339-344, 1991.

    Google Scholar 

  5. Krzysztof R. Apt and Roland N. Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19-20:9–71, 1994.

    Article  Google Scholar 

  6. [Apt et al., 1999]_K. R. Apt, V. Marek, M. Truszczynski, and D. S. Warren, editors. The Logic Programming Paradigm: Current Trends and Future Directions, Berlin, 1999. Springer.

    Google Scholar 

  7. Krzysztof R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, chapter 10, pages 493–574. Elsevier Science Publishers, 1990.

    Google Scholar 

  8. [Aravindan et al., 1997]_Chandrabose Aravindan, Jürgen Dix, and Ilkka Niemelä. Dislop: A research project on disjunctive logic programming. AI Communications, 10(3/4):151–165, 1997.

    ISI  Google Scholar 

  9. F. Baader and B. Hollunder. Priorities on Defaults with Prerequisite and their Application in Treating Specificity in Terminological Default Logic. Journal of Automated Reasoning, 15: 41–68, 1995.

    Article  ISI  Google Scholar 

  10. [Balcázar et al., 1988]_J.L. Balcázar, I. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  11. Chitta Baral and Michael Gelfond. Logic Programming and Knowlege Representation. Journal of Logic Programming, 19-20:73–148, 1994.

    Article  Google Scholar 

  12. Chitta Baral and V.S. Subrahmanian. Dualities between Alternative Semantics for Logic Programming and Non-monotonic Reasoning. In Anil Nerode, Wiktor Marek, and V.S. Subrahmanian, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the first International Workshop, pages 69–86, Cambridge, Mass., July 1991. Washington D.C, MIT Press.

    Google Scholar 

  13. Chitta Baral and V.S. Subrahmanian. Stable and Extension Class Theory for Logic Programs and Default Logics. Journal of Automated Reasoning, 8,No. 3:345–366, 1992.

    Google Scholar 

  14. C. Baral. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, 2003. ISBN 0-521-81802-8.

    Google Scholar 

  15. C. Baral. Knowledge representation, reasoning and declarative problem solving with Answer sets. Cambridge University Press, 2003.

    Google Scholar 

  16. R. Barbuti and M. Martelli. Negation as Failure. Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definition. Journal of Automated Reasoning, 2:155–170, 1986.

    Google Scholar 

  17. Jon Barwise. Admissible Sets and Structures. Springer, 1975.

    Google Scholar 

  18. Catril Beeri and Raghu Ramakrishnan. On the power of magic. The Journal of Logic Programming, 10:255–299, 1991.

    Google Scholar 

  19. Rachel Ben-Eliyahu and Rina Dechter. Propositional Semantics for Disjunctive Logic Programs. In K. R. Apt, editor, LOGIC PROGRAMMING: Proceedings of the 1992 Joint International Conference and Symposium, pages 813-, Cambridge, Mass., November 1992. MIT Press.

    Google Scholar 

  20. [Benferhat et al., 1993]_Salem Benferhat, Claudette Cayrol, Didier Dubois, Jérôme Lang, and Henri Prade. Inconsistency Management and Prioritized Syntax-Based Entailment. In R. Bajcsy, editor, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 640–645. Morgan Kaufmann, 1993.

    Google Scholar 

  21. Nicole Bidoit and Christine Froidevaux. General logical Databases and Programs: Default Logic Semantics and Stratification. Information and Computation, 91:15–54, 1991.

    Article  ISI  Google Scholar 

  22. Nicole Bidoit and Christine Froidevaux. Negation by Default and unstratifiable logic Programs. Theoretical Computer Science, 78:85–112, 1991.

    Article  ISI  Google Scholar 

  23. Roland N. Bol and L. Degerstedt. Tabulated resolution for well-founded semantics. In Proc. Int. Logic Programming Symposium’93, Cambridge, Mass., 1993. MIT Press.

    Google Scholar 

  24. Piero Bonatti. Shift-based semantics: general results and applications. Technical Report CD-TR-93-59, Technical University of Vienna, Inst. für Informationssysteme, 1993.

    Google Scholar 

  25. Egon Börger. Unsolvable Decision Problems For Prolog Programs. In Egon Börger, editor, Computation Theory and Logic, LNCS 270, pages 37–47, Berlin, 1987. Springer.

    Google Scholar 

  26. Stefan Brass and Jürgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfinger, editor, Innovationen bei Rechen-und Kommunikationssystemen, (IFIP’ 94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83–91, Berlin, 1994. Springer.

    Google Scholar 

  27. Stefan Brass and Jürgen Dix. A General Approach to Bottom-Up Computation of Disjunctive Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 127–155. Springer, Berlin, 1995.

    Google Scholar 

  28. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207–228, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85-98, 1995. LNCS 928, Springer.).

    Article  ISI  Google Scholar 

  29. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143–165, 1998. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA’ 96, pages 268-283, 1996. Springer, LNCS 1126.).

    Article  ISI  Google Scholar 

  30. Stefan Brass and Jürgen Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 38(3):167–213, 1999. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings of the 12-th International Logic Programming Conference, Tokyo, pages 199-213, 1995. MIT Press.).

    Google Scholar 

  31. [Brass et al., 1999]_Stefan Brass, Jürgen Dix, and Teodor Przymusinski. Computation of the semantics of autoepistemic belief theories. Artificial Intelligence, 112(1-2):104–123, 1999. (Partial results appeared in: Super Logic Programs. Proceedings of the 5-th International Conference on Principles of Knowledge Representation and Reasoning. Boston, MA, pages 529-541, 1996. Morgan Kaufman.).

    Article  Google Scholar 

  32. [Brass et al., 2001a]_Stefan Brass, Jürgen Dix, Burkhardt Freitag, and Ulrich Zukowski. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming, 1(5):497–538, 2001.

    Article  ISI  Google Scholar 

  33. [Brass et al., 2001b]_Stefan Brass, Jürgen Dix, Ilkka Niemelä, and Teodor Przymusinski. On the Equivalence of the Static and Disjunctive Well-Founded Semantics and its Computation. Theoretical Computer Science, 258(1-2):523–553, 2001.

    Article  ISI  Google Scholar 

  34. [Brass et al., 2004]_Stefan Brass, Jürgen Dix, and Teodor Przymusinski. Super Logic Programs. ACM Transactions of Computational Logic, 5(1):129–176, 2004.

    Google Scholar 

  35. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109:297–356, 1999.

    Article  ISI  Google Scholar 

  36. [Brewka et al., 1997]_Gerd Brewka, Jürgen Dix, and Kurt Konolige. Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes 73.CSLI Publications, Stanford, CA, 1997.

    Google Scholar 

  37. [Brewka et al., 2002]_G. Brewka, I. Niemelä, and T. Syrjänen. Implementing ordered disjunction using answer set solvers for normal programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA 2002), pages 444–455. Springer Verlag, 2002.

    Google Scholar 

  38. [Brewka et al., 2003]_G. Brewka, I. Niemelä, and M. Truszczyński. Answer set optimization. In Proceedings International Joint Conference on Artificial Intelligence, IJCAI-03, pages 867–872. Morgan Kaufmann, 2003.

    Google Scholar 

  39. [Brewka et al., 2004]_G. Brewka, S. Benferhat, and D. Le Berre. Qualitative choice logic. Artificial Intelligence, Special Issue on Nonmonotonic Reasoning, 2004. to appear.

    Google Scholar 

  40. G. Brewka. Adding priorities and specificity to default logic. In Logics in Artificial Intelligence, Proc. JELIA-94, York. Springer, 1994.

    Google Scholar 

  41. Gerd Brewka. Principles of Knowledge Representation. CSLI Publications, Studies in Logic, Language and Information, 1996.

    Google Scholar 

  42. Gerhard Brewka. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4:19–36, 1996.

    ISI  Google Scholar 

  43. Gerhard Brewka. On the relation between defeasible logic and wellfounded semantics. In Proceedings LPNMR-2001, pages 121–132. Springer Verlag, 2001.

    Google Scholar 

  44. G. Brewka. Logic programming with ordered disjunction. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02). Morgan Kaufmann, 2002.

    Google Scholar 

  45. G. Brewka. Complex preferences for answer set optimization. In Proceedings 9th International Conference on Principles of Knowledge Representation and Reasoning, KR-04. Morgan Kaufmann, 2004.

    Google Scholar 

  46. Francois Bry. Query evaluation in recursive databases: bottom-up and topdown reconciled. Data & Knowledge Engineering, 5:289–312, 1990.

    Article  Google Scholar 

  47. [Buccafurri et al., 1996]_F. Buccafurri, N. Leone, and P. Rullo. Stable Models and their Computation for Logic Programming with Inheritance and True Negation. The Journal of Logic Programming, 27(1):5–43, 1996.

    Article  Google Scholar 

  48. [Buccafurri et al., 1998]_F. Buccafurri, N. Leone, and P. Rullo. Disjunctive ordered logic: Semantics and expressiveness. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 418–429. Morgan Kaufmann, 1998.

    Google Scholar 

  49. Marco Cadoli and Marco Schaerf. A Survey of Complexity Results for Non-Monotonic Logics. Journal of Logic Programming, 17:127–160, 1993.

    Article  ISI  Google Scholar 

  50. [Cadoli et al., 1992]_Marco Cadoli, Thomas Eiter, and Georg Gottlob. An efficient method for eliminating varying predicates from a circumscription. Artificial Intelligence Journal, 54:397–410, 1992.

    Article  Google Scholar 

  51. [Cadoli et al., 1995]_M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. The size of a revised knowledge base. In PODS’ 95, pages 151–162, 1995.

    Google Scholar 

  52. [Cadoli et al., 1996]_Marco Cadoli, Francesco M. Donini, and Marco Schaerf. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence Journal, 88:215–251, 1996.

    Article  Google Scholar 

  53. [Cadoli et al., 1997]_Marco Cadoli, Francesco M. Donini, Marco Schaerf, and Riccardo Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182:183–202, 1997. (Extended abstract appeared in: On Compact Representations of Propositional Circumscription. STACS’ 95, pages 205-216, 1995.).

    Article  ISI  Google Scholar 

  54. L. Cavedon and J.W. Lloyd. A Completeness Theorem for SLDNF-Resolution. Journal of Logic Programming, 7:177–191, 1989.

    Article  ISI  Google Scholar 

  55. David Chan and Mark Wallace. An Experiment with programming using pure Negation. Technical Report TR, ECRC, July 1989.

    Google Scholar 

  56. David Chan. Constructive negation based on the completed database. In Proc. 1988 Conf. and Symp. on Logic Programming, pages 111–125, September 1988.

    Google Scholar 

  57. Edward P.F. Chan. A Possible World Semantics for Disjunctive Databases. IEEE Trans. on Knowledge and Data Engineering, 5(2):282–292, 1993.

    Google Scholar 

  58. Weidong Chen and David S. Warren. A Goal Oriented Approach to Computing The Well-founded Semantics. Journal of Logic Programming, 17:279–300, 1993.

    Article  ISI  Google Scholar 

  59. Weidong Chen and David S. Warren. Computing of Stable Models and its Integration with Logical Query Processing. IEEE Transactions on Knowledge and Data Engineering, 17:279–300, 1995.

    Google Scholar 

  60. Weidong Chen and David S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, January 1996.

    Article  ISI  Google Scholar 

  61. [Chen et al., 1995]_Weidong Chen, Terrance Swift, and David S. Warren. Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming, 24(3):219–245, 1995.

    Article  Google Scholar 

  62. [Chesnevar et al., 2003]_C. Chesnevar, Jürgen Dix, F. Stolzenburg, and G. Simari. Relating Defeasible and Normal Logic Programming through Transformation Properties. Theoretical Computer Science, 290(1): 499–529, 2003.

    Article  ISI  Google Scholar 

  63. Jan Chomicki and V.S. Subrahmanian. Generalized Closed World Assumption is Π 02 -Complete. Information Processing Letters, 34:289–291, 1990.

    Article  ISI  Google Scholar 

  64. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293–322. Plenum, New York, 1978.

    Google Scholar 

  65. [Colmerauer et al., 1973]_A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un système de communication homme-machine en franÇais. Technical report, Groupe de Intelligence Artificielle Universite de Aix-Marseille II, 1973.

    Google Scholar 

  66. Stefania Costantini and Gaetano A. Lanzarone. Static Semantics as Program Transformation and Well-founded Computation. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 156–180. Springer, Berlin, 1995.

    Google Scholar 

  67. Hendrik Decker and Lawrence Cavedon. Generalizing syntactic properties which ensure that SLDNF-Resolution is complete and flounder-free. Technical report, ECRC Munich, January 1990.

    Google Scholar 

  68. Lars Degerstedt and Ulf Nilsson. Magic Computation of Well-founded Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 181–204. Springer, Berlin, 1995.

    Google Scholar 

  69. [Delgrande et al., 2003]_J. Delgrande, T. Schaub, and H. Tompits. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, 3(2):129–187, 2003.

    Article  ISI  Google Scholar 

  70. Jürgen Dix and Martin Müller. An Axiomatic Framework for Representing and Characterizing Semantics of Disjunctive Logic Programs. In Pascal Van Hentenryck, editor, Proceedings of the 11th Int. Conf. on Logic Programming, S. Margherita Ligure, pages 303–322. MIT, June 1994.

    Google Scholar 

  71. Jürgen Dix and Martin Müller. Partial Evaluation and Relevance for Approximations of the Stable Semantics. In Z.W. Ras and M. Zemankova, editors, Proceedings of the 8th Int. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, 1994, LNAI 869, pages 511–520, Berlin, 1994. Springer.

    Google Scholar 

  72. Jürgen Dix and Martin Müller. The Stable Semantics and its Variants: A Comparison of Recent Approaches. In L. Dreschler-Fischer and B. Nebel, editors, Proceedings of the 18th German Annual Conference on Artificial Intelligence (KI’ 94), Saarbrücken, Germany, LNAI 861, pages 82–93, Berlin, 1994. Springer.

    Google Scholar 

  73. Jürgen Dix and Frieder Stolzenburg. A Framework to incorporate Nonmonotonic Reasoning into Constraint Logic Programming. Journal of Logic Programming, 37(1,2,3):47–76, 1998. Special Issue on Constraint Logic Programming, Guest Editors: Kim Marriott and Peter Stuckey.

    Google Scholar 

  74. [Dix et al., 1994]_Jürgen Dix, Georg Gottlob, and Viktor Marek. Causal Models for Disjunctive Logic Programs. In Pascal Van Hentenryck, editor, Proceedings of the 11th Int. Conf. on Logic Programming, S. Margherita Ligure, pages 290–302. MIT, June 1994.

    Google Scholar 

  75. [Dix et al., 1995]_J. Dix, L. Pereira, and T. Przymusinski, editors. Non-Monotonic Extensions of Logic Programming, LNAI 927, Berlin, 1995. Springer.

    Google Scholar 

  76. [Dix et al., 1996a]_Jürgen Dix, Georg Gottlob, and Viktor Marek. Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae, XXVIII(1/2):87–100, 1996.

    Google Scholar 

  77. [Dix et al., 1996b]_Jürgen Dix, Donald Loveland, Jack Minker, and David. S. Warren. Disjunctive Logic Programming and databases: Nonmonotonic Aspects. Technical Report Dagstuhl Seminar Report 150, IBFI GmbH, Schloß Dagstuhl, 1996.

    Google Scholar 

  78. [Dix et al., 1997a]_J. Dix, U. Furbach, and A. Nerode, editors. Logic Programming and Nonmonotonic Reasoning, LNAI 1265, Berlin, 1997. Springer.

    Google Scholar 

  79. [Dix et al., 1997b]_J. Dix, L. Pereira, and T. Przymusinski, editors. Non-Monotonic Extensions of Logic Programming, LNAI 1216, Berlin, 1997. Springer.

    Google Scholar 

  80. [Dix et al., 2000a]_Jürgen Dix, Mirco Nanni, and V. S. Subrahmanian. Probabilistic agent reasoning. ACM Transactions of Computational Logic, 1(2):201–245, 2000.

    Google Scholar 

  81. [Dix et al., 2000b]_Jürgen Dix, V.S. Subrahmanian, and George Pick. Meta Agent Programs. Journal of Logic Programming, 46(1-2):1–60, 2000.

    Article  ISI  Google Scholar 

  82. [Dix et al., 2001a]_Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. In Andrei Voronkov and Alan Robinson, editors, Handbook of Automated Reasoning, pages 1121–1234. Elsevier-Science-Press, 2001.

    Google Scholar 

  83. [Dix et al., 2001b]_Jürgen Dix, Sarit Kraus, and V.S. Subrahmanian. Temporal agent reasoning. Artificial Intelligence, 127(1):87–135, 2001.

    Article  ISI  Google Scholar 

  84. [Dix et al., 2003a]_Juergen Dix, Thomas Eiter, Michael Fink, Axel Polleres, and Yingqian Zhang. Monitoring Agents using Declarative Planning. Fundamenta Informaticae, 57(2-4):345–370, 2003.

    ISI  Google Scholar 

  85. [Dix et al., 2003b]_Juergen Dix, Ugur Kuter, and Dana Nau. Planning in answer set programming using ordered task decomposition. In R. Kruse, editor, Proceedings of the 27th German Annual Conference on Artificial Intelligence (KI’ 03), Hamburg, Germany, LNAI 2821, pages 490–504, Berlin, 2003. Springer.

    Google Scholar 

  86. [Dix et al., 2004a]_Jürgen Dix, Michael Fisher, Hector Levesque, and Leo Sterling, editors. Logic Based Implementation of Agent Systems, volume 41(2-4) of Special Issue of the Annals in Mathematics and Artificial Intelligence. Baltzer Science Publishers, 2004.

    Google Scholar 

    Google Scholar 

  87. [Dix et al., 2004b]_Jürgen Dix, Sarit Kraus, and V.S. Subrahmanian. Heterogenous temporal probabilistic agents. ACM Transactions of Computational Intelligence, 2004. to appear.

    Google Scholar 

  88. [Dix et al., 2004c]_Jürgen Dix, Joao Leite, and Ken Satoh, editors. Computational Logic and Multi Agency, volume 42(1-3) of Special Issue of the Annals in Mathematics and Artificial Intelligence. Baltzer Science Publishers, 2004.

    Google Scholar 

    Google Scholar 

  89. Jürgen Dix. Classifying Semantics of Logic Programs. In Anil Nerode, Wiktor Marek, and V.S. Subrahmanian, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the first International Workshop, pages 166–180, Cambridge, Mass., July 1991. Washington D.C, MIT Press.

    Google Scholar 

  90. Jürgen Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR’ 92), pages 591–602. San Mateo, CA, Morgan Kaufmann, 1992.

    Google Scholar 

  91. Jürgen Dix. Classifying Semantics of Disjunctive Logic Programs. In K. R. Apt, editor, LOGIC PROGRAMMING: Proceedings of the 1992 Joint International Conference and Symposium, pages 798–812, Cambridge, Mass., November 1992. MIT Press.

    Google Scholar 

  92. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Pro-grams: I. Strong Properties. Fundamenta Informaticae, XXII(3):227–255, 1995.

    Google Scholar 

  93. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257–288, 1995.

    Google Scholar 

  94. Jürgen Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Andre Fuhrmann and Hans Rott, editors, Logic, Action and Information — Essays on Logic in Philosophy and Artificial Intelligence, pages 241–327. DeGruyter, 1995.

    Google Scholar 

  95. Jürgen Dix. The Logic Programming Paradigm. AI Communications, Vol. 11,No. 3: 39–43, 1998. Short version in Newsletter of ALP, Vol. 11(3), 1998, pages 10-14.

    Google Scholar 

  96. Jürgen Dix. A Computational Logic Approach to Heterogenous Agent Systems. In Th. Eiter, M. Truszczyński, and W. Faber, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Sixth International Conference, LNCS 2173, pages 1–21, Berlin, September 2001. Springer.

    Google Scholar 

  97. W.F. Dowling and J.H. Gallier. Linear Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming, 1:267–284, 1984.

    Article  Google Scholar 

  98. Wlodzimierz Drabent. What is failure? A constructive approach to negation. Acta Informatica, 32(1):27–29, 1994.

    ISI  Google Scholar 

  99. P. M. Dung. On the relations between stable and wellfounded semantics of logic programs. Theoretical Computer Science, 105:7–25, 1992.

    Article  ISI  Google Scholar 

  100. T. Eiter and G. Gottlob. Complexity Aspects of Various Semantics for Disjunctive Databases. In Proceedings of the Twelth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-93), pages 158–167, June 1993.

    Google Scholar 

  101. Thomas Eiter and Georg Gottlob. Propositional Circumscription and Extended Closed World Reasoning are Π P2 -complete. Theoretical Computer Science, 144(2):231–245, Addendum: vol. 118, p. 315, 1993, 1993.

    Google Scholar 

  102. Thomas Eiter and Georg Gottlob. The Complexity of Logic-Based Abduction. Journal of the ACM, 42(1):3–42, January 1995.

    Article  Google Scholar 

  103. [Eiter et al., 1993]_Thomas Eiter, Georg Gottlob, and Heikki Mannila. Expressive Power and Complexity of Disjunctive DATALOG. In Proceedings of Workshop on Logic Programming with Incomplete Information, Vancouver Oct. 1993, following ILPS’ 93, pages 59–79, 1993.

    Google Scholar 

  104. [Eiter et al., 1997a]_T. Eiter, J. Lu, and V. S. Subrahmanian. Computing Non-Ground Representations of Stable Models. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Fourth International Conference, LNAI 1265, pages 198–217, Berlin, July 1997. Springer.

    Google Scholar 

  105. [Eiter et al., 1997b]_Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, and Francesco Scarcello. A Deductive System for Nonmonotonic Reasoning. In Jürgen Dix, Ulrich Furbach, and Anil Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’ 97), number 1265 in Lecture Notes in AI (LNAI), Berlin, 1997. Springer.

    Google Scholar 

  106. [Eiter et al., 1998]_Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, and Francesco Scarcello. The KR System dlv: Progress Report, Comparisons and Benchmarks. In Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 406–417, 1998.

    Google Scholar 

  107. [Eiter et al., 1999a]_T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The diagnosis frontend of the dlv system. AI Communications, 12(1-2):99–111, 1999.

    ISI  Google Scholar 

  108. [Eiter et al., 1999b]_Thomas Eiter, V.S. Subrahmanian, and Georg Pick. Heterogeneous Active Agents, I: Semantics. Artificial Intelligence, 108(1-2):179–255, 1999.

    ISI  Google Scholar 

  109. [Eiter et al., 2000]_T. Eiter, V.S. Subrahmanian, and T.J. Rogers. Heterogeneous Active Agents, III: Polynomially Implementable Agents. Artificial Intelligence, 117(1):107–167, 2000.

    Article  ISI  Google Scholar 

  110. [Eiter et al., 2002]_T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. Answer set planning under action costs. In Proc. JELIA 2002, volume 12(1-2), pages 186–197. Springer LNCS 2424, 2002.

    Google Scholar 

  111. F. Fages. Consistency of Clark’s completion and existence of stable models. Methods of Logic in Computer Science, 2, 1993.

    Google Scholar 

  112. J. A. Fernández and J. Minker. Bottom-Up Computation of Perfect Models for Disjunctive Theories. Journal of Logic Programming, 25(1):33–51, 1995.

    Google Scholar 

  113. [Fernández et al., 1993]_J. A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive LP + Integrity Constraints = Stable Model Semantics. Annals of Mathematics and Artificial Intelligence, 8(3-4), 1993.

    Google Scholar 

  114. Melvin C. Fitting. A Kripke-Kleene Semantics of logic Programs. Journal of Logic Programming, 4:295–312, 1985.

    Google Scholar 

  115. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  116. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  117. M. Gelfond and R. Son. Reasoning with prioritized defaults. In J. Dix, L.M. Pereira, and T. Przymusinski, editors, Logic Programming and Knowledge Representation, pages 164–223. Springer LNAI 1471, 1998.

    Google Scholar 

  118. [Gogic et al., 1995]_Goran Gogic, Christos Papadimitriou, Bart Selman, and Henry Kautz. The Comparative Linguistics of Knowledge Representation. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 862–869, Montreal, Canada, August 1995. Morgan Kaufmann Publishers.

    Google Scholar 

  119. B. Grosof. Diplomat: Compiling prioritized rules into ordinary logic programs for e-commerce applications (intelligent systems demonstration abstract). In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 1999.

    Google Scholar 

  120. Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger, editor, Trends in Theoretical Computer Science, chapter 1. Computer Science Press, 1988.

    Google Scholar 

  121. [Horty et al., 1990]_Jeff Horty, Richmond Thomason, and D. S. Touretzky. A skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. Artificial Intelligence, 42:311–348, 1990.

    Article  ISI  Google Scholar 

  122. T. Imielinski. Incomplete Deductive Databases. Annals of Mathematics and Artificial Intelligence, 3:259–294, 1991.

    Article  Google Scholar 

  123. [Inoue et al., 1992]_Katsumi Inoue, M. Koshimura, and R. Hasegawa. Embedding negation-as-failure into a model generation theorem prover. In Deepak Kapur, editor, Automated Deduction — CADE-11, number 607 in LNAI, Berlin, 1992. Springer.

    Google Scholar 

  124. D.S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A. Algorithms and Complexity, pages 67–161. Elsevier, 1990.

    Google Scholar 

  125. [Kagan et al., 1994]_Vadim Kagan, Anil Nerode, and V.S. Subrahmanian. Computing Definite Logic Programs by Partial Instantiation. Annals of Pure and Applied Logic, 67:161–182, 1994.

    Article  ISI  Google Scholar 

  126. [Kagan et al., 1995]_Vadim Kagan, Anil Nerode, and V.S. Subrahmanian. Computing Minimal Models by Partial Instantiation. Theoretical Computer Science, 155:157–177, 1995.

    ISI  Google Scholar 

  127. [Kemp et al., 1991]_David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic Sets and Bottom-Up Evaluation of Well-Founded Models. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 Int. Symposium on Logic Programming, pages 337–351. MIT, June 1991.

    Google Scholar 

  128. K. Konolige. Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning. In Proceedings AAAI’ 88, 1988.

    Google Scholar 

  129. R.A. Kowalski. Predicate logic as a programming language. In Proceeedings IFIP’ 74, pages 569–574. North Holland Publishing Company, 1974.

    Google Scholar 

  130. Kenneth Kunen. Negation in Logic Programming. Journal of Logic Programming, 4:289–308, 1987.

    Article  ISI  Google Scholar 

  131. Kenneth Kunen. Signed Data Dependencies. Journal of Logic Programming, 7:231–245, 1989.

    Article  ISI  Google Scholar 

  132. E. Laenens and D. Vermeir. A Fixpoint Semantics for Ordered Logic. The Journal of Logic Programming, 1:159–185, 1990.

    Google Scholar 

  133. Vladimir Lifschitz. Computing Circumscription. In Proceedings of the International Joint Conference on Artificial Intelligence, Los Angeles, California, pages 121–127, 1985.

    Google Scholar 

  134. V. Lifschitz. Circmscription, pages 297–353. Clarendon, Oxford, 1994.

    Google Scholar 

  135. V. Lifschitz. Foundations of declarative logic programming. In G. Brewka, editor, Principles of Knowledge Representation, chapter 3, pages 69–128. CSLI, 1996.

    Google Scholar 

  136. V. Lifschitz. Answer set programming and plan generation. Artificial Intelligence Journal, 138(1-2):39–54, 2002.

    Article  Google Scholar 

  137. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.

    Google Scholar 

  138. [Lobo et al., 1992]_Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT-Press, 1992.

    Google Scholar 

  139. [Mancarella et al., 1988]_Paolo Mancarella, Simone Martini, and Dino Pedreschi. Complete logic Programs with domain-closure Axiom. Journal of Logic Programming, 5:263–276, 1988.

    Article  ISI  Google Scholar 

  140. W. Marek and M. Truszczyński. Nonmonotonic Logics — Context-Dependent Reasoning. Springer-Verlag, 1993.

    Google Scholar 

  141. W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. In Apt et al. [1999], pages 375–398.

    Google Scholar 

  142. [Marek et al., 1992]_Wiktor Marek, Arcot Rajasekar, and Mirek Truszczyński. Complexity of Computing with Extended Propositional Logic Programs. In Proc. of the Workshop W1, Structural Complexity and Recursion-theoretic Methods in Logic Programming, following the IJCSLP’ 92, pages 93–102. H. Blair and W. Marek and A. Nerode and J. Remmel, November 1992.

    Google Scholar 

  143. John McCarthy. First order theories of individual concepts and propositions. In B. Meltzer and D. Michie, editors, Machine Intelligence 9, pages 120–147. Edinburgh University Press, Edinburgh, 1979.

    Google Scholar 

  144. John McCarthy. Circumscription: A Form of Nonmonotonic Reasoning. Artificial Intelligence, 13:27–39, 1980.

    ISI  Google Scholar 

  145. John McCarthy. Applications of Circumscription to formalizing Common-Sense Reasoning. Artificial Intelligence, 28:89–116, 1986.

    Article  ISI  Google Scholar 

  146. Jack Minker and Carolina Ruiz. Computing stable and partial stable models of extended disjunctive logic programs. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 205–229. Springer, Berlin, 1995.

    Google Scholar 

  147. Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, New York, pages 292–308, Berlin, 1982. Springer.

    Google Scholar 

  148. Jack Minker. Foundations of Deductive Databases. Morgan Kaufmann, 95 First Street, Los Altos, CA 94022, 1st edition, 1988.

    Google Scholar 

  149. Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17(2/3/4):95–126, 1993.

    ISI  Google Scholar 

  150. Jack Minker. Logic and databases: A 20 year retrospective. In Dino Pedreschi and Carlo Zaniolo, editors, Proceedings of the International Workshop on Logic in Databases (LID), LNCS 1154, pages 3–58. Springer, Berlin, 1996.

    Google Scholar 

  151. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North-Holland, 1974.

    Google Scholar 

  152. B. Nebel. How Hard is it to Revise a Belief Base? In Handbook on Defeasible Reasoning and Uncertainty Management Systems, Volume 3: Belief Change, pp. 77–146, D. Dubois and H. Prade (eds), 1998.

    Google Scholar 

  153. Ilkka Niemelä and Patrik Simons. Efficient Implementation of the Well-founded and Stable Model Semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, Bonn, Germany, September 1996. The MIT Press.

    Google Scholar 

  154. Ilkka Niemelä. Implementing circumscription using a tableau method. In W. Wahlster, editor, Proceedings of the European Conference on Artificial Intelligence, pages 80–84, Budapest, Hungary, August 1996. John Wiley.

    Google Scholar 

  155. Ilkka Niemelä. A tableau calculus for minimal model reasoning. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278–294, Terrasini, Italy, May 1996. LNAI 1071, Springer-Verlag.

    Google Scholar 

  156. Ilkka Niemelä. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence, Special Issue on Logics in Artificial Intelligence, edited by J. Dix and J. Lobo, 25(3-4):241–273, 1999.

    Google Scholar 

  157. P. Odifreddi. Classical Recursion Theory. North-Holland, 1989.

    Google Scholar 

  158. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  159. L.M. Pereira and J.J. Alferes. Well founded semantics for logic programs with explicit negation. In Bernd Neumann, editor, Proc. of 10th European Conf. on Artificial Intelligence ECAI 92, pages 102–106. John Wiley & Sons, 1992.

    Google Scholar 

  160. D. Poole. On the comparison of theories: Preferring the most specific explanation. In Proc. IJCAI-85, Los Angeles, 1985.

    Google Scholar 

  161. H. Prakken. Logical Tools for Modelling Legal Argument. PhD thesis, VU Amsterdam, 1993.

    Google Scholar 

  162. Teodor Przymusinski. Static Semantics For Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.

    Article  ISI  Google Scholar 

  163. [Rajasekar et al., 1989]_Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak Generalized Closed World Assumption. Journal of Automated Reasoning, 5:293–307, 1989.

    Article  Google Scholar 

  164. R. Reiter. On Closed-World Databases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55–76. Plenum Press, New York, 1978.

    Google Scholar 

  165. Raymond Reiter. A Logic for Default-Reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  ISI  Google Scholar 

  166. Kenneth A. Ross and Rodney A. Topor. Inferring negative Information from disjunctive Databases. Journal of Automated Reasoning, 4:397–424, 1988.

    Article  Google Scholar 

  167. Kenneth A. Ross. The well-founded semantics for disjunctive logic programs. In Proceedings of the first International Conference on Deductive and Object Oriented Databases, Kyoto, Japan, pages 1–22, 1989.

    Google Scholar 

  168. Stuart Russel and Peter Norvig. Artificial Intelligence — A Modern Approach. Prentice Hall, New Jersey 07458, 1995.

    Google Scholar 

  169. Domenico Sacca. The Expressive Power of Stable Models For DATALOG Queries with Negation. In Proceedings of Workshop on Logic Programming with W Incomplete Information, Vancouver Oct. 1993, following ILPS’ 93, pages 150–162, 1993.

    Google Scholar 

  170. Chiaki Sakama and Katsumi Inoue. Negation in Disjunctive Logic Programs. In D. Warren and Peter Szeredi, editors, Proceedings of the 10th Int. Conf. on Logic Programming, Budapest, pages 703–719, Cambridge, Mass., July 1993. MIT Press.

    Google Scholar 

  171. Ch. Sakama and K. Inoue. An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases. Journal of Automated Reasoning, 13:145–172, 1994.

    Article  ISI  Google Scholar 

  172. C. Sakama and K. Inoue. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123(1-2):185–222, 2000.

    Article  ISI  Google Scholar 

  173. Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Logic Program Synthesis and Transformation — Meta Programming in Logic, LNCS 883, pages 170–182, Berlin, 1994. Springer.

    Google Scholar 

  174. Chiaki Sakama and Hirohisa Seki. Partial Deduction in Disjunctive Logic Programming. Journal of Logic Programming, 32(3):229–245, 1997.

    Article  ISI  Google Scholar 

  175. Chiaki Sakama. Possible Model Semantics for Disjunctive Databases. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Deductive and Object-Oriented Databases, Proceedings of the First International Conference (DOOD89), pages 369–383, Kyoto, Japan, 1989. North-Holland Publ.Co.

    Google Scholar 

  176. T. Schaub and K. Wang. A comparative study of logic programs with preference. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, IJCAI-01, 2001.

    Google Scholar 

  177. John S. Schlipf. The Expressive Powers of the Logic Programming Semantics. In Proceedings of the Ninth ACM Symposium on Principles of Databases, pages 196–204, 1990.

    Google Scholar 

  178. John S. Schlipf. A Survey of Complexity and Undecidability Results in Logic Programming. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, Proceedings of the Workshop on Complexity and Recursion-theoretic Methods in Logic Programming, following the JICSLP’92. informal, 1992.

    Google Scholar 

  179. John C. Shepherdson. Negation in Logic Programming. In Jack Minker, editor, Foundations of Deductive Databases, chapter 1, pages 19–88. Morgan Kaufmann, 1988.

    Google Scholar 

  180. John C. Shepherdson. Unsolvable Problems for SLDNF-Resolution. Journal of Logic Programming, 10:19–22, 1991.

    Article  ISI  Google Scholar 

  181. John C. Shepherdson. SLDNF-Resolution with Equality. Journal of Automated Reasoning, 8,No. 2:297–306, 1992.

    Article  Google Scholar 

  182. T. Soininen. An Approach to Knowledge Representation and Reasoning for Product Configuration Tasks. PhD thesis, Helsinki University of Technology, Finland, 2000.

    Google Scholar 

  183. Robert F. Stärk. Input/output dependencies of normal logic programs. Journal of Logic and Computation, 4(3):249–262, 1994.

    Google Scholar 

  184. [Subrahmanian et al., 2000]_V.S. Subrahmanian, Piero Bonatti, Jürgen Dix, Thomas Eiter, Sarit Kraus, Fatma Ozcan, and Robert Ross. Heterogenous Active Agents. MIT-Press, 2000.

    Google Scholar 

  185. Terry Swift. Using Tabling for nonmonotonic Programming. Annals of Mathematics and Artificial Intelligence, Special Issue on Logics in Artificial Intelligence, edited by J. Dix and J. Lobo, 1999.

    Google Scholar 

  186. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In Proceedings of the Third International Conference on Logic Programming, London, LNAI, pages 84–98, Berlin, June 1986. Springer.

    Google Scholar 

  187. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.

    Google Scholar 

  188. Robert Miller Toni Kakas and Francesca Toni. E-res: Reasoning about actions, events and observations. In Proceedings LPNMR-2001, pages 254–266. Springer Verlag, 2001.

    Google Scholar 

  189. [Touretzky et al., 1988]_David S. Touretzky, Jeff Horty, and Richmond Thomason. A Clash of Intuitions: The current State of Nonmonotonic Multiple IHS. In Proceedings IJCAJ, 1988.

    Google Scholar 

  190. [Touretzky et al., 1991]_D. S. Touretzky, R. H. Thomason, and J. F. Horty. A skeptic’s menagerie: Conflictors, preemptors, reinstaters, and zombies in nonmonotonic inheritance. In Proc. 12th IJCAI, Sydney, 1991.

    Google Scholar 

  191. D. S. Touretzky. The Mathematics of Inheritance. Research Notes in Artificial Intelligence. Pitman, London, 1986.

    Google Scholar 

  192. J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, 1989.

    Google Scholar 

  193. Jeffrey D. Ullman. Bottom-up Beats Top-down for Datalog. In Proc. of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, pages 140–149. ACM Press, March 1989.

    Google Scholar 

  194. M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. JACM, 23:733–742, 1976.

    Google Scholar 

  195. [Van Gelder et al., 1988]_Allen Van Gelder, Kenneth A. Ross, and J. S. Schlipf. Unfounded Sets and well-founded Semantics for general logic Programs. In Proceedings 7th Symposion on Principles of Database Systems, pages 221–230, 1988.

    Google Scholar 

  196. Cees Witteveen. Partial Semantics for Truth Maintenance. In J. van Eijck, editor, Logics in AI, LNAI 478, Berlin, 1991. Springer.

    Google Scholar 

  197. Cees Witteveen. Skeptical Reason Maintenance is Tractable. In J. Allen, R. Fikes, and B. Sandewall, editors, Proceedings of the second Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusetts, pages 570–581. Morgan Kaufmann, 1991.

    Google Scholar 

Download references

Authors
  1. Gerhard Brewka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Dix
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. King’s College, London, UK

    D.M. Gabbay

  2. Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität, München, Germany

    F. Guenthner

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer

About this chapter

Cite this chapter

Brewka, G., Dix, J. (2005). Knowledge Representation with Logic Programs. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol 12. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3092-4_1

Download citation

Publish with us

Policies and ethics

Search

Navigation