A deduction method complete for refutation and finite satisfiability

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

Volumn 1489, Issue , 1998, Pages 122-138

  Bry, François ^a   Torge, Sunna ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Artificial intelligence; Automated reasoning; Databases; Expert systems; Finite satisfiability

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; EXPERT SYSTEMS;

AUTOMATED REASONING; EXISTENTIAL QUANTIFIERS; FINITE SATISFIABILITY; SKOLEMIZATION;

FORMAL LOGIC;

EID: 84949976019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_9     Document Type: Conference Paper

References (37)

1. S. Abdennadher and H. Schütz. Model Generation with Existentially Quantified Variables and Constraints. Proc. 6th Int. Conf. on Algebraic and Logic Programming, Springer LNCS 1298, 1997.
2. C. Aravindan and P. Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. Proc. Int. Logic Programming Symposium, MIT Press, 1997.
3. P. Baumgartner, U. Furbach, and I. Niemela. Hyper tableaux. Proc. 5th Europ. Workshop on Logics in AI (JELIA), Springer LNCS 1126, 1996.
4. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Tableaux for Diagnosis Applications. Proc. 6th Workshop on Theorem Proving with Tableaux and Related Methods, Springer LNAI, 76-90, 1997.
5. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications. Proc. 15th Int. Joint Conf. on Artificial Intelligence (IJCAI), 460-465, 1997.
6. E. W. Beth. The Foundations of Mathematics. North Holland, 1959.
7. F. Bry. Intensional Updates: Abduction via Deduction. Proc. 7th Int. Conf. on Logic Programming, MIT Press, 561-575, 1990.
8. F. Bry, N. Eisinger, H. Schutz, and S. Torge. SIC: An Interactive Tool for the Design of Integrity Constraints (System Description). EDBT'98 Demo Session Proceedings, 45-46, 1998.
9. F. Bry, N. Eisinger, H. Schutz, and S. Torge. SIC: Satisfiability Checking for Integrity Constraints. Proc. Deductive Databases and Logic Programming (DDLP), Workshop at JICSLP, 1998.
10. F. Bry and R. Manthey. Proving Finite Satisfiability of Deductive Databases. Proc. 1st Workshop on Computer Science Logic, Springer LNCS 329, 44-55, 1987.
11. F. Bry and A. Yahya. Minimal Model Generation with Positive Unit Hyperresolution Tableaux. Proc. 5th Workshop on Theorem Proving with Tableaux and Related Methods, Springer LNAI 1071, 1996.
12. R. Caferra and N. Zabel. Building Models by Using Tableaux Extended by Equa-tional Problems. J. of Logic and Computation, 3, 3-25, 1993.
13. M. Denecker and D. de Schreye. On the Duality of Abduction and Model Generation in a Framework of Model Generation with Equality. Theoretical Computer Science, 122, 1994.
14. N. Eisinger and T. Geisler. Problem Solving with Model-Generation Approaches based on PUHR Tableaux. Proc. Workshop on Problem-solving Methodologies with Automated Deduction, Workshop at CADE-15, 1998.
15. C. Fermuller and A. Leitsch. Hyperresolution and Automated Model Building. J. of Logic and Computation, 6:2,173-203, 1996.
16. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1990.
17. H. Fujita and R. Hasegawa. A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm. Proc. 8th Int. Conf. on Logic Programming, MIT Press, 1991.
18. U. Furbach, ed. Tableaux and Connection Calculi. Part I.InAutomated Deduction - A Basis for Applications. Kluwer Academic Publishers, 1998. To appear.
19. H. Gallaire, J. Minker, and J.-M. Nicolas. Logic and Databases: A Deductive Approach. ACM Computing Surveys, 16:2, 1984.
20. J. Hintikka. Model Minimization - An Alternative to Circumscription. J. of Automated Reasoning, 4, 1988.
21. K. M. Hornig. Generating Small Models of First Order Axioms. Proc. GWAI-81, Informatik-Fachberichte 47, Springer-Verlag, 1981.
22. M. Kettner and N. Eisinger. The Tableaux Browser SNARKS (System Description). Proc. 14th Int. Conf. on Automated Deduction, Springer LNAI 1249, 1997.
23. S. Lorenz. A Tableaux Prover for Domain Minimization. J. ofAutomated Reasoning, 13, 1994.
24. D. W. Loveland, D. W. Reed, and D. S. Wilson. SATCHMORE: SATCHMO with RElevancy. J. of Automated Reasoning, 14, 325-351, 1995.
25. R. Manthey and F. Bry. SATCHMO: A Theorem Prover Implemented in Prolog. Proc. 9th Int. Conf. on Automated Deduction, Springer LNAI 310, 1988.
26. I. Niemela. A Tableaux Calculus for Minimal Model Reasoning. Proc. 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Springer LNAI 1071, 1996.
27. N. Peltier. Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models. Proc. 6th Workshop on Theorem Proving with Tableaux and Related Methods, Springer LNAI 1227, 1997.
28. D. Poole. Normality and Faults in Logic-Based Diagnosis. Proc. 11th Int. Joint Conf. on Artificial Intelligence, 1304-1310, 1985.
29. R. Reiter. A Theory of Diagnosis from First Principles. Artificial Intelligence, 32, 57-95, 1987.
30. M. Paramasivam and D. Plaisted. Automated Deduction Techniques for Classification in Description Logic Systems. J. ofAutomated Reasoning, 20(3), 1998.
31. J. Slaney. Finder (finite domain enumerator): Notes and Guides. Tech. rep., Australian National University Automated Reasoning Project, Canberra, 1992.
32. R. Smullyan. First-Order Logic. Springer, 1968.
33. T. Tammet. Using Resolution for Deciding Solvable Classes and Building Finite Models. Baltic Computer Science, Springer LNCS 502, 1991.
34. G. Wrightson ed. Special Issue on Automated Reasoning with Analytic Tableaux, Parts I and II. J. ofAutomated Reasoning, 13:2-3, 173-421, 1994.
35. M. Tiomkin. Proving Unprovability. Proc. 3rd Symp. Logic in Computer Science, 22-26, 1988.
36. B. A. Trakhtenbrot. Impossibility of an Algorithm for the Decision Problem in Finite Classes. Proc. Dokl. Acad. Nauk., SSSR 70, 1950.
37. Jian Zhang and Hantao Zhang. SEM: A System for Enumerating Models. Proc. International Joint Conference on Artificial Intelligence, 1995.