Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning

Volumn 18, Issue 3, 1997, Pages 297-336

  Doherty, Patrick ^a   Łukaszewicz, Witold ^b   Szałas, Andrzej ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Circumscription; Common sense reasoning; Nonmonotonic reasoning; Quantifier elimination

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

CIRCUMSCRIPTION AXIOMS; COMMON SENSE REASONING;

FORMAL LOGIC;

EID: 0031166270     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1005722130532     Document Type: Article

References (22)

1. Ackermann, W.: Untersuchungen über das Eliminationsproblem der mathematischen logik, Mathematische Annalen 110 (1935), 390-413.
2. Ackermann, W.: Solvable Cases of the Decision Problem, North-Holland, Amsterdam, 1954.
3. Van Benthem, J.: Modal Logic and Classical Logic, Bibliopolis, Napoli, 1983.
4. Van Benthem, J.: Correspondence theory, in D. Gabbay and F. Guenthner (eds), Handbook of Philosophical Logic, Vol. 2, Reidel, Dordrecht, 1984, pp. 167-247.
5. Van Benthem, J.: Semantic parallels in natural language and computation, in H.-D. Ebbinghaus et al. (eds), Logic Colloquium, Granada 1987, 1989, pp. 331-375.
6. Doherty, P., Łukaszewicz, W. and Szałas, A.: A Characterization Result for Circumscribed Normal Logic Programs, Technical Report LITH-IDA-95-20, Department of Computer and Information Science, Linköping University, Linköping, Sweden, 1995. Also to appear in Fundamenta Informaticae, 1996.
7. Doherty, P., Łukaszewicz, W. and Szałas, A.: General Domain Circumscription and Its First-Order Reduction, Technical Report LITH-IDA-95, Department of Computer and Information Science, Linköping University, Linköping, Sweden, 1995. See also: Proceedings of FAPR'96 (D. Gabbay, H. J. Ohlbach, eds.), LNAI 1085, Springer-Verlag, 1996, 93-109.
8. Gabbay, D. and Ohlbach, H. J.: Quantifier Elimination in Second-Order Predicate Logic, Technical Report MPI-I-92-231, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1992.
9. Gelfond, M. and Lifschitz, V.: Compiling circumscriptive theories into logic programs, in: Proc. 2nd Int. Workshop on Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence 346, Springer-Verlag, Berlin, 1989, pp. 74-99.
10. Ginsberg, M. L.: A circumscriptive theorem prover, Artificial Intelligence 39 (1989), 209-230.
11. Kartha, G. N. and Lifschitz, V.: A simple formalization of actions using circumscription, in Proc. 14th Int. Joint Conf. Artificial Intelligence, 1995.
12. Kolaitis, P. and Papadimitriou, C.: Some computational aspects of circumscription, in AAAI-88: Proc. 7th Nat. Conf. Artificial Intelligence, 1988, pp. 465-469.
13. Lifschitz, V.: Computing circumscription, in Proc. 9th Int. Joint Conf. Artificial Intelligence, Vol. 1, 1985, pp. 121-127.
14. Lifschitz, V.: Pointwise circumscription, in M. Ginsberg (ed.), Readings in Nonmonotonic Reasoning, Morgan Kaufmann, 1988, pp. 179-193.
15. Lifschitz, V.: Circumscription, in D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds), Nonmonotonic Reasoning and Uncertain Reasoning, Handbook of Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, 1994.
16. Lifschitz, V.: Nested abnormality theories, Artificial Intelligence 74(2) (1995), 351-365.
17. Löwenheim, L.: Über Möglichkeiten im Relativekalkül, Mathematische Annalen (1915), 137-148.
18. McCarthy, J.: Circumscription, a form of nonmonotonic reasoning, Artificial Intelligence 13(1-2) (1980), 27-39.
19. Przymusinski, T.: An algorithm to compute circumscription, Artificial Intelligence 38 (1991), 49-73.
20. Rabinov, A.: A generalization of collapsible cases of circumscription (research note), Artificial Intelligence 38 (1989), 111-117.
21. Reiter, R.: A logic for default reasoning, Artificial Intelligence 13 (1980), 81-132.
22. Szałas, A.: On the correspondence between modal and classical logic: An automated approach, J. Logic and Computation 3 (1993), 605-620.