General Domain Circumscription and its Effective Reductions

Fundamenta Informaticae

Volumn 36, Issue 1, 1998, Pages 23-55

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

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040880587     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-3612     Document Type: Article

References (16)

1. Ackermann, W. (1935) Untersuchungen über das Eliminationsproblem der mathematischen Logik, Mathematische Annalen, 110, 390-413.
2. Davis, M. (1980) The Mathematics of Non-Monotonic Reasoning, Artificial Intelligence J., 13, 73-80.
3. Doherty, P., Łukaszewicz, W., Szałas, A. (1994) Computing Circumscription Revisited. Preliminary Report, Proc. 14th IJCAI, 1995, Montreal, Canada.
4. Doherty, P., Łukaszewicz, W., Szałas, A. (1995) A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae, 28(3,4), 261-272.
5. Doherty, P., Łukaszewicz, W., Szałas, A. (1996) General Domain Circumscription and its First-Order Reduction, Proceedings of the FAPR'96 Conference, Gabbay, D. and Ohlbach, H-J. (eds.), LNAI 1085, Springer-Verlag.
6. Doherty, P., Łukaszewicz, W., Szałas, A. (1997) Computing Circumscription Revisited: A Reduction Algorithm, Journal of Automated Reasoning, 18: 297-336.
7. Etherington, D. W., Mercer, R. (1987) Domain Circumscription: A Reevaluation, Computational Intelligence, 3, 94-99.
8. Gabbay, D., Ohlbach, H-J. (1992) Quantifier elimination in second-order predicate logic. Technical Report MPI-I-92-231, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1992.
9. Gustafsson, J. (1996) An Implementation and Optimization of an Algorithm for Reducing Formulae in Second-Order Logic, Technical Report LiTH-Mat-Ex-96-04, Linköping University, 1996.
10. Hintikka, J. (1988) Model Minimization - An Alternative to Circumscription, Journal of Automated Reasoning, 4,1-13.
11. Lorenz, S. (1994) A Tableau Prover for Domain Minimization, Journal of Automated Reasoning, 13, 375-390.
12. Łukaszewicz, W. (1990) Non-Monotonic Reasoning - Formalization of Commonsense Reasoning, Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, 1990.
13. McCarthy, J. (1977) Epistemological Problems of Artificial Intelligence, in: Proc. 5th IJCAI, Cambridge, MA, 1977, 1038-1044.
14. Nonnengart, A., Szałas, A. (1995) A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, Report of Max-Planck-Institut für Informatik, MPI-I-95-2-007, Saarbrücken, Germany. To appear in E. Orlowska (ed.) Logic at Work. Essays Dedicated to the Memory of Helena Raiowa, Physica Verlag 1998.
15. Suchenek, M. A. (1993) First-Order Syntactic Characterizations of Minimal Entailment, Domain-Minimal Entailment, and Herbrand Entailment, Journal of Automated Reasoning, 10, 237-263.
16. Szałas, A. (1993) On the Correspondence Between Modal and Classical Logic: an Automated Approach, Journal of Logic and Computation, 3, 605-620.