General domain circumscription and its first-order reduction

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

Volumn 1085, Issue , 1996, Pages 93-109

  Doherty, Patrick ^a   Lukaszewicz, Witold ^b   Szałas, Andrzej ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EXISTING DOMAINS; FIRST ORDER; FIRST ORDER THEORIES; FIXPOINTS; FUNCTION SYMBOLS; SECOND ORDERS; UNIVERSAL THEORY;

EQUIVALENCE CLASSES;

EID: 84886694793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61313-7_65     Document Type: Conference Paper

References (13)

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. 9
4. Doherty, P., Lukaszewicz, W., Szałas, A. (1995) A Reduction Result for Circumscribed Semi-Horn Formulas, To appear in Fundamenta Informaticae, 1996.
5. Doherty, P., Lukaszewicz, W., Szałas, A. (1995) General Domain Circumscription and its First-Order Reduction, Technical Report LiTH-IDA-R-96-01, Linköping U niversity.
6. Etherington, D. W., Mercer, R. (1987) Domain Circumscription: A Revaluation, Computational Intelligence, 3, 94-99.
7. Hintikka, J. (1988) Model Minimization - An Alternative to Circumscription, Journal of Automated Reasoning, 4, 1-13.
8. Lorenz, S. (1994) A Tableau Prover for Domain Minimization, Journal of Automated Reasoning, 13, 375-390.
9. Lukaszewicz, W. (1990) Non-Monotonic Reasoning - Formalization of Common-sense Reasoning, Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, 1990.
10. McCarthy, J. (1977) Epistemological Problems of Artificial Intelligence, in: Proc. 5th IJCAI, Cambridge, MA, 1977, 1038-1044.
11. Nonnengart, A., Szałas, A. (1995) A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, Report of Max-PlanckInstitut für Informatik, MPI-I-95-2-007, Saarbrücken, Germany.
12. Suchanek, M. A. (1993) First-Order Syntactic Characterizations of Minimal Entailment, Domain-Minimal Entailment, and Herbrand Entailment, Journal of Automated Reasoning, 10, 237-263.
13. Szałas, A. (1993) On the Correspondence Between Modal and Classical Logic: an Automated Approach, Journal of Logic and Computation, 3, 605-620.