Towards first-order nonmonotonic reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1730, Issue , 1999, Pages 332-346

  Rosati, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

DEFAULT LOGIC; DISJUNCTIVE DATALOG; EXTENSIONS OF FIRST-ORDER LOGIC; FIRST ORDER LOGIC; NEGATION AS FAILURES; NON-MONOTONIC REASONING; NONMONOTONIC LOGIC; REASONING METHODS;

FORMAL LOGIC;

EID: 84958618807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_24     Document Type: Conference Paper

References (25)

1. A. Beringer and T. Schaub. Minimal belief and negation as failure: a feasible approach. In Proc. of the 11th Nat. Conf. on Artificial Intelligence (AAAI’93), pages 400-405, 1993.
2. M. Cadoli and M. Schaerf. A survey of complexity results for non-monotonic logics. J. of Logic Programming, 17:127-160, 1993.
3. F. M. Donini, D. Nardi, and R. Rosati. Autoepistemic description logics. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI’97), pages 136-141, 1997.
4. F. M. Donini, D. Nardi, and R. Rosati. Ground nonmonotonic modal logics. J. of Logic and Computation, 7(4):523-548, Aug. 1997.
5. T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are IIp 2-complete. Theoretical Computer Science, 114:231-245, 1993.
6. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
7. G. Gottlob. Complexity results for nonmonotonic logics. J. of Logic and Computation, 2:397-425, 1992.
8. G. Gottlob. NP trees and Carnap’s modal logic. J. of the ACM, 42(2):421-457, 1995.
9. J. Y. Halpern and Y. Moses. Towards a theory of knowledge and ignorance: Preliminary report. In K. Apt, editor, Logic and models of concurrent systems. Springer-Verlag, 1985.
10. K. Inoue and C. Sakama. On positive occurrences of negation as failure. In Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’94), pages 293-304. Morgan Kaufmann, Los Altos, 1994.
11. M. Kaminski. Embedding a default system into nonmonotonic logics. Fundamenta Informaticae, 14:345-354, 1991.
12. K. Konolige. On the relation between autoepistemic logic and circumscription. In Proc. of the 11th Int. Joint Conf. on Artificial Intelligence (IJCAI’89), pages 1213-1218, 1989.
13. G. Lakemeyer. Limited reasoning in first-order knowledge bases with full introspection. Artificial Intelligence, 84:209-255, 1996.
14. H. J. Levesque. All I know: a study of autoepistemic logic. Artificial Intelligence, 42:263-310, 1990.
15. V. Lifschitz. Nonmonotonic databases and epistemic queries. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91), pages 381-386, Sydney, 1991.
16. V. Lifschitz. Minimal belief and negation as failure. Artificial Intelligence, 70:53-72, 1994.
17. V. Lifschitz and T. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In Proc. of the 3rd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’92), pages 603-614. Morgan Kaufmann, Los Altos, 1992.
18. F. Lin and Y. Shoham. Epistemic semantics for fixed-point non-monotonic logics. Artificial Intelligence, 57:271-289, 1992.
19. W. Marek and M. Truszczyński. Nonmonotonic Logics-Context-Dependent Reasoning. Springer-Verlag, 1993.
20. R. C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25:75-94, 1985.
21. I. Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117-156, 1992.
22. R. Rosati. Reasoning with minimal belief and negation as failure: Algorithms and complexity. In Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI’97), pages 430-435. AAAI Press/The MIT Press, 1997.
23. R. Rosati. Reducing query answering to satisfiability in nonmonotonic logics. In Proc. of the 15th Nat. Conf. on Artificial Intelligence (AAAI’98), pages 853-858. AAAI Press/The MIT Press, 1998.
24. G. Schwarz. Autoepistemic logic of knowledge. In Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’91), pages 260-274. The MIT Press, 1991.
25. G. Schwarz and V. Lifschitz. Extended logic programs as autoepistemic theories. In Proc. of the 2nd Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’93), pages 101-114. The MIT Press, 1993.