Combining decision procedures for positive theories sharing constructors

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

Volumn 2378, Issue , 2002, Pages 352-366

  Baader, Franz ^a   Tinelli, Cesare ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DECISION PROCEDURE; EQUATIONAL THEORY; UNIFICATION PROBLEM;

DECISION THEORY;

EID: 84947227552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_25     Document Type: Conference Paper

References (13)

1. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proc. CADE-11, Springer LNCS 607, 1992.
2. F. Baader and K.U. Schulz. Combination of constraint solving techniques:An algebraic point of view. In Proc. RTA’95, Springer LNCS 914, 1995.
3. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation 21, 1996.
4. F. Baader and C. Tinelli. Combining decision procedures for positive theories sharing constructors. Technical report no. 02-02, Dept. of Computer Science, University of Iowa, 2002 (available at http://cs.uiowa.edu/˜tinelli/papers.html).
5. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 2002. To appear (preprint available at http://cs.uiowa.edu/˜tinelli/papers.html).
6. E. Domenjoud, F. Klay, and Ch. Ringeissen. Combination techniques for nondisjoint equational theories. In Proc. CADE-12, Springer LNCS 814, 1994.
7. W. Hodges. Model Theory, Cambridge University Press, 1993.
8. G. Nelson and D.C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems 1, 1979.
9. D. Pigozzi. The join of equational theories. Colloquium Mathematicum 30, 1974.
10. Ch. Ringeissen. Personal communication, 2001.
11. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation 8, 1989.
12. M. E. Stickel. A unification algorithm for associative commutative functions. J. ACM 28, 1981.
13. C. Tinelli and Ch. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 2002. To appear (preprint available at http://cs.uiowa.edu/˜tinelli/papers.html).