Extensions for open default theories via the domain closure assumption

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

Volumn 1126, Issue , 1996, Pages 373-387

  Kaminski, Michael ^a   Makowsky, Johann A ^a   Tiomkin, Michael ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CLOSURE ASSUMPTIONS; DEFAULT LOGIC; FINITE DOMAINS; FIRST ORDER; MINIMALITY; OPEN DEFAULTS;

ARTIFICIAL INTELLIGENCE;

EID: 21444461068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (10)

1. C.C. Chang and H.J. Keisler, Model Theory, North Holland Publishing Co., Amsterdam, 1990.
2. M.A. Dickmann, Large Infinitary Languages, North Holland Publishing Co., Amsterdam, 1975.
3. R. Guerreiro and M. Casanova, An alternative semantics for default logic, preprint, the Third International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, 1990.
4. M. Kaminski, A Comparative Study of Open Default Theories, Artificial Intelligence 77 (1995), 285-319.
5. K. Konolige, Quantification in autoepistemic logic, Fundamenta Informaticae 15 (1991), 275-300.
6. V. Lifschitz, On open defaults, in Computational Logic: Symposium Proceedings, J.W. Lloyd Ed., Springer-Verlag, Berlin, 1990, pp. 80-95.
7. J.W. Lloyd, Foundations of Logic Programming, Second Extended Edition, Springer- Veflag, Berlin, 1993.
8. E. Mendelson, Introduction to Mathematical Logic, Wadsworth and Brooks, Monterey, California, 1987.
9. D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988), 27-47.
10. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81-132.