Cooperation of background reasoners in theory reasoning by residue sharing (2003) [10 citations — 1 self]
Download:
|
|
by Cesare Tinelli
Journal of Automated Reasoning
http://cs.uiowa.edu/combination/papers/Tin-FTP-00.ps.gz
Add To MetaCart
Abstract:
Abstract. We propose a general way of combining background reasoners in theory reasoning. Using a restricted version of the Craig Interpolation Lemma, we show that background reasoner cooperation can be achieved as a form of constraint propagation, much in the spirit of existing combination methods for decision procedures. In this case, constraint information is propagated across reasoners by exchanging residues over a common signature. As an application of our approach, we describe a multi-theory version of the semantic tableau calculus. 1
Citations
| 284 | Simplification by Cooperating Decision Procedures – Nelson, Oppen - 1979 |
| 114 | Automated deduction by theory resolution – Stickel - 1985 |
| 28 | Complexity, convexity and combinations of theories – Oppen - 1980 |
| 18 | An ordered theory resolution calculus – Baumgartner |
| 9 | A resolution principle for constraint logics – Burckert - 1994 |
| 9 | Constraint logic programming over unions of constraint theories – Tinelli, Harandi - 1998 |
| 8 | A Unified Approach to Theory Reasoning – Baumgartner, Furbach, et al. - 1992 |
| 7 | Cooperation of decision procedures in a tableau-based theorem prover. Revue d'Intelligence Artificielle – Kaufl, Zabel - 1990 |
| 4 | Incremental theory reasoning methods for semantic tableaux – Pape - 1996 |
| 3 | Using decision procedures to accelerate domain-specific deductive synthesis systems – Baalen, Roach - 1999 |
| 3 | Linear and Unit-Resulting Refutations for Horn Theories – Baumgartner - 1996 |
| 1 | Connection calculus theorem proving with multiple built-in theories – Petermann - 2000 |
