A reduction result for circumscribed semi-horn formulas

Fundamenta Informaticae

Volumn 28, Issue 3-4, 1996, Pages 261-271

  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

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING;

BOUNDEDNESS CRITERION; CIRCUMSCRIBED SEMI HORN FORMULAS; FIXPOINT CALCULUS;

ARTIFICIAL INTELLIGENCE;

EID: 0030383468     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-283404     Document Type: Article

References (14)

1. Ackermann, W. (1935) Untersuchungen über das Eliminationsproblem der mathematischen Logik, Mathematische Annalen, 110, 390-413.
2. Doherty, P., Łukaszewicz, W., Szałas, A. (1994) Computing Circumscription Revisited. A Reduction Algorithm, Technical Report LiTH-IDA-R-94-42, Linköping University, 1994.
3. 2 Full version to appear in Journal of Automated Reasonig.
4. Gelfond, M., Lifschitz, V. (1989) Compiling Circumscriptive Theories into Logic Programs, in: Proc. 2nd Int'l Workshop on Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence, 346, Springer-Verlag, Berlin, 74-99.
5. Ginsberg, M. L. (1989) A Circumscriptive Theorem Prover, in: Artificial Intelligence, 39, 209-230.
6. Kolaitis, P., Papadimitriou, C. (1988) Some Computational Aspects of Circumscription, in: Proc. AAAI-88, St Paul, MN, 465-469.
7. Kozen, D. (1983) Results on the Propositional μ-calculus, Theoretical Computer Science, 27, 333-354.
8. Lifschitz, V. (1985) Computing Circumscription, in: Proc. 9th IJCAI, Los Angeles, CA, 121-127.
9. Lifschitz, V. (1994) Circumscription, in: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3 (D.M. Gabbay, C.J. Hogger & J.A. Robinson, eds.), Clarendon Press, Oxford, 297-352.
10. 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.
11. Przymusinski, T. (1991) An Algorithm to Compute Circumscription, in: Artificial Intelligence 38, 49-73.
12. Szałas, A. (1992) Axiomatizing Fixpoint Logics, Information Processing Letters, 41, 175-180.
13. Szałas, A. (1993) On the Correspondence Between Modal and Classical Logic: an Automated Approach, Journal of Logic and Computation, 3, 605-620.
14. Szałas, A. (1995) On Natural Deduction in First-Order Fixpoint Logics, Fundamenta Informaticae (to appear).