Merge path improvements for minimal model hyper tableaux

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

Volumn 1617, Issue , 1999, Pages 51-66

  Baumgartner, Peter ^a   Horton, J D ^a   Spencer, Bruce ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

EFFICIENCY IMPROVEMENT; ELECTRICAL CIRCUIT; FIRST ORDER THEOREM PROVING; MINIMAL MODEL; RECONVERGENT FAN-OUTS; SOUND AND COMPLETE;

COMPUTATION THEORY;

EID: 84957360419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48754-9_9     Document Type: Conference Paper

References (16)

1. C. Aravindan and P. Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. In Proc. ILPS, New York, 1997. The MIT Press.
2. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications. In Proc. IJCAI 97, pages 460-465, Nagoya, 1997.
3. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper Tableaux. In Proc. JELIA 96, LNAI 1126. Springer, 1996.
4. P. Baumgartner, J.D. Horton, and B. Spencer. Merge Path Improvements for Minimal Model Hyper Tableaux. Fachberichte Informatik 1-99, Universität Koblenz-Landau, 1999. URL: http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/RR-1-99.ps.gz
5. F. Bry and A. Yahya. Minimal Model Generation with Positive Unit Hyper- Resolution Tableaux. In Miglioli et al. [11], pages 143-159.
6. 2-complete. Theoretical Computer Science, 114:231-245, 1993.
7. J. D. Horton and B. Spencer. Clause trees: a tool for understanding and implementing resolution in automated reasoning. Artificial Intelligence, 92:25-89, 1997.
8. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding Negation as Failure into a Model Generation Theorem Prover. In D. Kapur, editor, In Proc. CADE 11, LNAI 607, pp. 400-415. Springer, 1992.
9. R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.
10. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In E. Lusk and R. Overbeek, editors, Proc. CADE 9, LNCS 310, pp. 415-434. Springer, 1988.
11. P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors. Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071. Springer, 1996.
12. I. Niemelä. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. [11].
13. I. Niemelä. Implementing circumscription using a tableau method. In Proc. ECAI, pages 80-84, Budapest, 1996. John Wiley.
14. N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99-139, 1992.
15. T. Przymusinski. An Algorithm to Compute Circumscription. Artificial Intelligence, 38:49-73, 1989.
16. R. Reiter. A Theory of Diagnosis from First Principles. Artificial Intelligence, 32(1):57-95, Apr. 1987.