Advertisement

Benchmark problems for formal nonmonotonic reasoning

Version 2.00
  • Vladimir Lifschitz
Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 346)

Keywords

Frame Problem Default Theory Default Logic Nonmonotonic Reasoning Deductive Database 
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, Krzysztof, Blair, Howard and Walker, Adrian (1988). Towards a theory of declarative knowledge, in: Minker, J. (ed.), Foundations of Deductive Databases and Logic Programming, Los Altos, CA: Morgan Kaufmann, pp. 89–148.Google Scholar
  2. Brewka, Gerhard (1987). The Logic of Inheritance in Frame Systems, Proc. IJCAI-87, pp. 483–488.Google Scholar
  3. Etherington, David; Mercer, Robert and Reiter, Raymond (1985). On the Adequacy of Predicate Circumscription for Closed-World Reasoning, Computational Intelligence 1, pp. 11–15. Reprinted in (Ginsberg 1987).Google Scholar
  4. Etherington, David and Reiter, Raymond (1983). On Inheritance Hierarchies with Exceptions, Proc. AAAI-83, pp. 104–108. Reprinted in (Ginsberg 1987).Google Scholar
  5. Clark, Keith (1978). Negation as Failure, in Gallaire, H. and Minker, J. (eds.), Logic and Databases, New York: Plenum Press, pp. 293–322. Reprinted in (Ginsberg 1987).Google Scholar
  6. Gelfond, Michael (1988). Autoepistemic Logic and Formalization of Commonsense Reasoning, this volume.Google Scholar
  7. Genesereth, Michael and Nilsson, Nils (1987). Logical Foundations of Artificial Intelligence, Los Altos, CA: Morgan Kaufmann.Google Scholar
  8. Ginsberg, Matthew (1987) (ed.) Readings in Nonmonotonic Reasoning, Los Altos, CA: Morgan Kaufmann.Google Scholar
  9. Ginsberg, Matthew (1988). Multivalued Logics: A Uniform Approach to Reasoning in AI, to appear in Computational Intelligence.Google Scholar
  10. Hanks, Steve and McDermott, Drew (1986). Default Reasoning, Nonmonotonic Logics, and the Frame Problem, Proc. AAAI-86 1, pp. 328–333. Reprinted in (Ginsberg 1987).Google Scholar
  11. Hanks, Steve and McDermott, Drew (1987). Nonmonotonic Logic and Temporal Projection, Artificial Intelligence 33, pp. 379–412.Google Scholar
  12. Horty, John and Thomason, Richmond (1988). Mixing Strict and Defeasible Inheritance, Proc. AAAI-88, pp. 427–432.Google Scholar
  13. Imielinski, Tomasz (1987). Results on Translating Defaults to Circumscription. Artificial Intelligence 32, pp. 131–146.Google Scholar
  14. de Kleer, Johan (1986). An Assumption-based TMS. Artificial Intelligence 28, pp. 127–162.Google Scholar
  15. Konolige, Kurt (1987). On the Relation between Default and Autoepistemic Logic, in (Ginsberg 1987), pp. 195–226.Google Scholar
  16. Levesque, Hector (1988). All I Know: A Study in Autoepistemic Logic, to appear in Artificial Intelligence.Google Scholar
  17. Lifschitz, Vladimir (1985). Computing Circumscription, Proc. IJCAI-85, pp. 121–127. Reprinted in (Ginsberg 1987).Google Scholar
  18. Lifschitz, Vladimir (1987). Formal Theories of Action, in Brown, F. (ed.), The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop, Morgan Kaufmann, pp. 35–58. Reprinted in (Ginsberg 1987).Google Scholar
  19. Lifschitz, Vladimir (1988). Circumscriptive Theories: A Logic-Based Framework for Knowledge Representation, to appear in the Journal of Philosophical Logic.Google Scholar
  20. Lifschitz, Vladimir and Rabinov, Arkady (1988). Miracles in Formal Theories of Action, to appear in Artificial Intelligence.Google Scholar
  21. McCarthy, John (1980). Circumscription — a Form of Nonmonotonic Reasoning, Artificial Intelligence 13, pp. 27–39. Reprinted in (Ginsberg 1987).Google Scholar
  22. McCarthy, John (1986). Applications of Circumscription to Formalizing Commonsense Knowledge, Artificial Intelligence 28, pp. 89–116. Reprinted in (Ginsberg 1987).Google Scholar
  23. Morgenstern, Leora and Stein, Lynn (1988). Why Things go Wrong: a Formal Theory of Causal Reasoning, Proc. AAAI-88 2, pp. 518–523.Google Scholar
  24. Moore, Robert (1985). Semantical Considerations on Nonmonotonic Logic, Artificial Intelligence 25, pp. 75–94. Reprinted in (Ginsberg 1987).Google Scholar
  25. Morris, Paul (1987). Curing Anomalous Extensions, Proc. AAAI-87, pp. 437–442.Google Scholar
  26. Morris, Paul (1988). Autoepistemic Stable Closures and Contradiction Resolution, this volume.Google Scholar
  27. Perlis, Donald (1986). On the Consistency of Commonsense Reasoning, Computational Intelligence 2, pp. 180–190. Reprinted in (Ginsberg 1987).Google Scholar
  28. Poole, David (1988). A Logical Framework for Default Reasoning, Artificial Intelligence 36, pp. 27–47.Google Scholar
  29. Reiter, Raymond (1978). On Closed World Data Bases, in Gallaire, H. and Minker, J. (eds.), Logic and Databases, New York: Plenum Press, pp. 55–76. Reprinted in (Ginsberg 1987).Google Scholar
  30. Reiter, Raymond (1980). A Logic for Default Reasoning, Artificial Intelligence 13, pp. 81–132. Reprinted in (Ginsberg 1987).Google Scholar
  31. Reiter, Raymond (1984). Towards a Logical Reconstruction of Relational Database Theory, in M. L. Brodie, J. Mylopoulos and J. W. Schmidt (eds.), On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, Springer-Verlag, pp. 191–233.Google Scholar
  32. Reiter, Raymond and de Kleer, Johan (1987). Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report, Proc. AAAI-87, pp. 183–188.Google Scholar
  33. Ross, Kenneth and Topor, Rodney (1987). Inferring Negative Information from Disjunctive Databases, Technical Report 87/1, University of Melbourne; to appear in the Journal of Automated Reasoning.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  1. 1.Stanford UniversityStanfordUSA

Personalised recommendations