A tableau calculus for combining non-disjoint theories

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

Volumn 2381 LNAI, Issue , 2002, Pages 315-329

  Zarba, Calogero G ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

FIRST ORDER THEORIES; NELSON-OPPEN COMBINATION METHODS; SATISFIABILITY CHECKER;

CALCULATIONS;

EID: 84885218940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45616-3_22     Document Type: Conference Paper

References (18)

1. Alessandro Armando, Silvio Ranise, and Michäel Rusinowitch. Uniform derivation of decision procedures by superposition. In Laurent Fribourg, editor, Computer Science Logic, Volume 2142 of Lecture Notes in Computer Science, pages 513-527. Springer, 2001.
2. Franz Baader and Cesare Tinelli. Combining decision procedures for positive theories sharing constructors. In Sophie Tison, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science. Springer, 2002.
3. Jean-Paul Billon. The disconnection method. A confluent integration of unification in the analytic framework. In Pierangelo Miglioli, Ugo Moscato, Daniele Mundici, and Mario Ornaghi, editors, Theorem Proving with Analytic Tableaux and Related Methods, Volume 1071 of Lecture Notes in Artificial Intelligence, pages 110-126. Springer, 1996.
4. Eric Domenjoud, Francis Klay, and Christophe Ringeissen. Combination techniques for non-disjoint equational theories. In Alan Bundy, editor, Automated Deduction - CADE-12, Volume 814 of Lecture Notes in Artificial Intelligence, pages 267-281. Springer, 1994.
5. Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer, 2nd edition, 1996.
6. Bernhard Gramlich. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science, 165(1):97-131, 1996.
7. Thomas Kaufl and Nicolas Zabel. Cooperation of decision procedures in a tableau-based theorem prover. Reveu d'Intelligence Artificielle, 4(3):99-126, 1990.
8. Shie-Jue Lee and David A. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 9(1):25-42, 1992.
9. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
10. Enno Ohlebusch. Modular properties of composable term rewriting systems. Journal of Symbolic Computation, 20(1):1-41, 1995.
11. Christophe Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In Andrei Vonronkov, editor, Logic Programming and Automated Reasoning, Volume 624 of Lecture Notes in Artificial Intelligence, pages 261-272. Springer, 1992.
12. Christophe Ringeissen. Cooperation of decision procedures for the satisfiability problem. In Franz Baader and Klaus U. Schulz, editors, Frontiers of Combining Systems, Volume 3 of Applied Logic Series, pages 121-140. Kluwer Academic Publishers, 1996.
13. Raymond M. Smullyan. First-Order Logic. Springer, 1968.
14. Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Technical Report 02-03, Department of Computer Science, University of Iowa, 2002.
15. Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz, editors, Frontiers of Combining Systems, Volume 3 of Applied Logic Series, pages 103-120. Kluwer Academic Publishers, 1996.
16. Cesare Tinelli and Christophe Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Technical Report 01-02, Department of Computer Science, University of Iowa, 2001.
17. Ashish Tiwari. Decision Procedures in Automated Deduction. PhD thesis, State University of New Yorkat Stony Brook, 2000.
18. Calogero G. Zarba. Combining non-disjoint theories. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, International Joint Conference on Automated Reasoning (Short Papers), Technical Report DII 11/01, pages 180-189. University of Siena, Italy, 2001.