Tinelli C., Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing, Journal of Automated Reasoning, 2003 (to appear). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cooperation of Background Reasoners in Theory Reasoning by.. - Tinelli (2002) (7 citations) (Correct)
....for decision procedures [NO79] The main idea is to propagate information between Presburger arithmetic for instance is decidable but its (first order) axiomatization contains infinitely many instances of the induction schema. A preliminary version of this paper was presented at FTP 2000 [Tin00] reasoners by exchanging quantifier free residues (see later) over a common signature. The Craig Interpolation Lemma states that whenever two first order theories 2 are jointly unsatisfiable they have an interpolant, a sentence # made only of symbols shared by 2 , which is entailed by ....
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. In International Workshop on First Order Theorem Proving, FTP'2000, St Andrews (Scotland), July 2000.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2004) (1 citation) Self-citation (Tinelli) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-- 31, 2003.
Combining Decision Procedures for Theories in Sorted Logics - Tinelli, Zarba (2004) (1 citation) Self-citation (Tinelli) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1--31, January 2003.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Tinelli) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-- 31, January 2003.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Tinelli) (Correct)
....or not, and regardless of whether T is stably infinite or not. See Definition 2.2. See Definition 2.5. 1.1 Related work. Several researchers have worked on relaxing the requirements of the NelsonOppen combination method. The disjointness problem was addressed by Ghilardi [4] Tinelli [13], Tinelli and Ringeissen [15] and Zarba [20] The stably infiniteness requirement was addressed by Baader and Tinelli [1] for combinations problems concerning the word problem, and by Zarba [17,18,19] for combinations of integers with lists, sets, and multisets. The latter works by Zarba consider ....
Tinelli, C., Cooperation of background reasoners in theory reasoning by residue sharing, Journal of Automated Reasoning 30 (2003), pp. 1--31.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Tinelli) (Correct)
....over any arbitrary signature # is also decidable, regardless of whether T is stably infinite or not. 1.1 Related work Several researchers have worked on relaxing the requirements of the NelsonOppen combination method. The disjointness problem was addressed by Ghilardi [Ghi03] Tinelli [Tin03] Tinelli and Ringeissen [TR03] and Zarba [Zar02c] The stably infiniteness requirement was addressed by Baader and Tinelli [BT97] for combinations problems concerning the word problem, and by Zarba [Zar01, Zar02a, Zar02b] for combinations of integers with lists, sets, and multisets. The latter ....
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 2003. To appear.
Reasoners' Cooperation and Quantifier Elimination - Ghilardi (2003) (Correct)
No context found.
Tinelli C., Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing, Journal of Automated Reasoning, 2003 (to appear).
Model-Theoretic Methods in Combined Constraint Satisfiability - Ghilardi (2004) (1 citation) (Correct)
No context found.
Tinelli C., Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing, Journal of Automated Reasoning, 30(1), pp.1-31, (2003).
C-Tableaux - Zarba (2004) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):131, 2003.
Combining Decision Procedures - Manna, Zarba (2003) (3 citations) (Correct)
No context found.
C. Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Technical Report 02-03, Department of Computer Science, University of Iowa, 2002.
The Combination Problem in Automated Reasoning - Zarba (2004) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1--31, 2003.
A Tableau Calculus for Combining Non-Disjoint Theories - Zarba (2002) (Correct)
No context found.
Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Technical Report 02-03, Department of Computer Science, University of Iowa, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC