A tableau calculus for minimal model reasoning

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

Volumn 1071, Issue , 1996, Pages 278-294

  Niemelä, Ilkka ^a  

^a Dept Of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

BASIC PROCEDURE; COUNTER-MODELS; DECISION PROCEDURE; LOGICAL CONSEQUENCES; POLYNOMIAL SPACE; POLYNOMIAL-TIME DECISION PROCEDURES; RESTRICTED CUT; SEARCH SPACES;

CALCULATIONS;

EID: 84958961954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_18     Document Type: Conference Paper

References (16)

1. F. Bry and A. Yahya. Minimal model generation with positive unit hyperresolution tableaux. In Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 143-159, Terrasini, Italy, May 1996. Springer-Verlag. (This volume).
2. C. Chang and R. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
3. M. D'Agostino and M. Mondadori. The taming of the cut. Journal of Logic and Computation, 4:285-319, 1994.
4. T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are HP-complete. Theoretical Computer Science, 114:231-245, 1993.
5. R. Emery. Computing circumscriptive databases. Master's Thesis, University of Maryland, 1992.
6. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, New York, 1990.
7. D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors. Handbook of Logic and "Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning. Oxford University Press, Oxford, 1994.
8. M.L. Ginsberg. A circumscriptive theorem prover. Artificial Intelligence, 39:209-230, 1989.
9. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In The 11th International Conference on Automated Deduction, pages 400-415, Saratoga Springs, NY, USA, June 1992. Springer-Verlag.
10. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In Proceedings of the 9th International Conference on Automated Deduction, pages 415-434, Argonne, USA, May 1988. Springer-Verlag.
11. A. Nerode, R.T. Ng, and V.S. Subrahmanian. Computing circumscriptive databases: I. theory and algorithms. Information and Computation, 116:58-80, 1995.
12. N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99-139, 1992.
13. T.C. Przymusinski. An algorithm to compute circumscription. Artificial Intelli- gence, 38:49-73, 1989.
14. T.C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs, 1995. To appear.
15. R.M. Smullyan. First-Order Logic. Springer-Verlag, Berlin, 1968.
16. A. Yahya, J.A. Fernandez, and J. Minker. Ordered model trees: A normal form for disjunctive deductive databases. Journal of Automated Reasoning, 13(1):117-144, 1994.