Advertisement

Compiling circumscriptive theories into logic programs

  • Michael Gelfond
  • Vladimir Lifschitz
Implementing Circumscription
Part of the Lecture Notes in Computer Science book series (LNCS, volume 346)

Abstract

We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions.

Keywords

Logic Program Logic Programming Predicate Symbol Ground Term Ground Atom 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Apt et al., 1988]
    Krzysztof R. Apt, Howard A. Blair, and Adrian Walker. Towards a theory of declarative knowledge. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 89–148. Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar
  2. [Bossu and Siegel, 1985]
    Genevieve Bossu and Pierre Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25(1):13–63, 1985.Google Scholar
  3. [Clark, 1978]
    Keith Clark. Negation as failure. In: Logic and Databases, Gallaire, H. and J. Minker (eds.), Plenum Press, New York, 293–322.Google Scholar
  4. [van Emden and Kowalski, 1976]
    Maarten H. van Emden and Robert A. Kowalski. The semantics of predicate logic as a programming language, Journal ACM, 23(4):733–742, 1976.Google Scholar
  5. [Gelfond, 1987]
    Michael Gelfond. On stratified autoepistemic theories. In Proceedings AAAI-87, 1, 207–211. Morgan Kaufmann Publishers, Los Altos, CA, 1987.Google Scholar
  6. [Gelfond and Lifschitz, 1988]
    Michael Gelfond and Vladimir Lifschitz. Compiling circumscriptive theories into logic programs: Preliminary report. In Proceedings AAAI-88, Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar
  7. [Gelfond and Przymusinska, 1986]
    Michael Gelfond and Halina Przymusinska. Negation as failure: Careful closure procedure. Artificial Intelligence 30(3):273–288, 1986.Google Scholar
  8. [Ginsberg, 1988]
    Matthew Ginsberg. A circumscriptive theorem prover: preliminary report. In these Proceedings.Google Scholar
  9. [Lifschitz, 1985]
    Vladimir Lifschitz. Computing circumscription. In Proceedings IJCAI-85, 1, 121–127. Morgan Kaufmann Publishers, Los Altos, CA, 1985.Google Scholar
  10. [Lifschitz, 1986]
    Vladimir Lifschitz. On the satisfiability of circumscription. Artificial Intelligence, 28, 17–27.Google Scholar
  11. [Lifschitz, 1988]
    Vladimir Lifschitz. On the declarative semantics of logic programs with negation. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 177–192. Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar
  12. [McCarthy, 1980]
    John McCarthy. Circumscription—a form of non-monotonic reasoning. Artificial Intelligence 13(1,2):27–39, 1980.Google Scholar
  13. [McCarthy, 1986]
    John McCarthy. Applications of circumscription to formalizing commonsense knowledge, Artificial Intelligence 28(1):89–118, 1986.Google Scholar
  14. [Meltzer, 1966]
    Bernard Meltzer. Theorem proving for computers: some results on resolution and renaming. Comput. Journal, 8:341–343, 1966.Google Scholar
  15. [Przymusinski, 1986]
    Teodor Przymusinski, Query answering in circumscriptive and closed-world theories. In Proceedings AAAI-86, 1, 186–190. Morgan Kaufmann Publishers, Los Altos, CA, 1986.Google Scholar
  16. [Przymusinski, 1988a]
    Teodor Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 193–216. Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar
  17. [Przymusinski, 1988b]
    Teodor Przymusinski. On the Declarative and Procedural Semantics of Logic Programs. Preprint, University of Texas at El Paso, 1988.Google Scholar
  18. [Topor, 1986]
    Rodney Topor. Domain Independent Formulas and Databases. Technical Report 86/11, Department of Computer Science, University of Melbourne. To appear in Theoretical Computer Science.Google Scholar
  19. [Touretzky, 1986]
    David Touretzky. The Mathematics of Inheritance Systems. Research Notes in Artificial Intelligence, Pitman, London.Google Scholar
  20. [Van Gelder, 1988]
    Allen Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 149–176. Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Michael Gelfond
    • 1
  • Vladimir Lifschitz
    • 2
  1. 1.University of Texas at El PasoEl PasoUSA
  2. 2.Stanford UniversityStanfordUSA

Personalised recommendations