Minimal model generation with positive unit hyper-resolution tableaux

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

Volumn 1071, Issue , 1996, Pages 143-159

  Bry, François ^a   Yahya, Adnan ^a,b  

^a UNIVERSITY OF MUNICH   (Germany)

^b BIRZEIT UNIVERSITY   (Palestine)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONVENTIONAL MODELING; HERBRAND MODEL; HYPER-RESOLUTION; ITS EFFICIENCIES; MINIMAL MODEL; MINIMAL MODEL GENERATIONS; SEARCH STRATEGIES;

THEOREM PROVING;

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

References (14)

1. M. Denecker and D. Schreye. A framework for indeterministic model generation with equality. In Proc. Conf. on Fifth Generation Computer Systems., 1992.
2. J.A. Fernandez and J. Minker. Bottom-up evaluation of Hierarchical Disjunctive Deductive Databases. In Proc. 8 th Int. Conf. on Logic Programming, 660-675. MIT Press, 1991.
3. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1987.
4. H. Schfiz and T. Geisler.: Efficient model generation through compilation. Tech. Rep. PMS-96-2, Inst. ffir Informatik, Munich University, 1996. Submitted for pubhcation.
5. J. Hintikka. Model minimization - an alternative to circumscription. J. Automated Reasoning, Vol. 4, 1-13, 1988.
6. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In Proc. 11 th Int. Conf. on Automated Deduction, 1992.
7. R. Letz, K. Mayr, and C. Goller. Controlled integration of the cut rule into connection tableau calcuh. J. Automated Reasoning, Vol. 13 No. 3, 297-338, 1994.
8. R. Manthey and F. Bry. Satchmo: a theorem prover implemented in Prolog. In Proc. 9 th Conf. on Automated Deduction, 456-459, 1988.
9. I. Niemelä. A tableau calculus for minimal model reasoning. In Proc. 5 th. Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 1996. Springer- Verlag.
10. N. Ohvetti. Tableaux and sequent calculus for minimal entailment. J. Automated Reasoning, Vol. 9, 99-139, 1992.
11. D. Prawitz: A new improved proof procedure Theoria, Vol. 26, 102-139, 1960.
12. J.A. Robinson.: Automatic deduction with hyper-resoultion, Int. J. Computational Mathematics, Vol. 1,227-234, 1965.
13. M. Suchenek.: First-order syntactic characterizations of minimal entailment, domain minimal entailment and herbrand entailment. J. Automated Reasoning, Vol: 10, 237-236, 1993.
14. A. Yahya, J. A. Fernandez, and J. Minker. Ordered model trees: A normal form for disjunctive deductive databases. J. Automated Reasoning, Vol. 13 No. 1, 117-144, 1994.