Download:
|
by Calogero G. Zarba
In Uwe Egly and Christian G. Fermuller, editors, Automated Reasoning with Analytic
http://www.loria.fr/~zarba/papers/Zar02c.ps.gz
Add To MetaCart
Abstract:
Abstract. The Nelson-Oppen combination method combines ground satis ability checkers for rst-order theories satisfying certain conditions into a single ground satisability checker for the union theory. The most signi cant restriction that the combined theories must satisfy, for the Nelson-Oppen combination method to be applicable, is that they must have disjoint signatures. Unfortunately, this is a very serious restriction since many combination problems concern theories over non-disjoint signatures. In this paper we present a tableau calculus for combining rst-order theories over non-disjoint signatures. The calculus generalizes the NelsonOppen combination method to formulae with quantiers and to the union of arbitrary theories over non necessarily disjoint signatures. 1
Citations
|
340
|
First-Order Logic and Automated Theorem Proving (2 nd ed
– Fitting
- 1996
|
|
270
|
Simplification by cooperating decision procedures
– Nelson, Oppen
- 1979
|
|
210
|
First-order logic
– Smullyan
- 1968
|
|
47
|
A new correctness proof of the Nelson-Oppen combination procedure
– Tinelli, Harandi
- 1996
|
|
44
|
Modular properties of composable term rewriting systems
– Ohlebusch
- 1995
|
|
40
|
Eliminating Duplicates with the Hyper-Linking Strategy
– Lee, Plaisted
- 1992
|
|
28
|
Combination techniques for non-disjoint equational theories
– Domenjoud, Klay, et al.
- 1994
|
|
17
|
Unions of non-disjoint theories and combinations of satisfiability procedures
– Tinelli, Ringeissen
- 2003
|
|
15
|
Unification in a combination of equational theories with shared constants and its application to primal algebras
– Ringeissen
- 1992
|
|
10
|
Uniform Derivation of Decision Procedures by Superposition
– Armando, Ranise, et al.
- 2001
|
|
10
|
Cooperation of background reasoners in theory reasoning by residue sharing
– Tinelli
|
|
8
|
Decision Procedures in Automated Deduction
– Tiwari
- 2000
|
|
7
|
Cooperation of decision procedures in a tableau-based theorem prover. Revue d'Intelligence Artificielle
– Kaufl, Zabel
- 1990
|
|
6
|
Cooperation of decision procedures for the satis problem
– Ringeissen
- 1996
|
|
5
|
On termination and con properties of disjoint and constructor-sharing conditional rewrite systems
– Gramlich
- 1996
|
|
4
|
Combining decision procedures for positive theories sharing constructors
– Baader, Tinelli
- 2002
|
|
3
|
Combining non-disjoint theories
– Zarba
- 2001
|
|
1
|
The disconnection method. A con integration of uni in the analytic framework
– Billon
- 1996
|
