Building-In Hybrid Theories
Download:
|
|
by Uwe Petermann
ftp://ftp.logic.at/pub/ftp97/peterman.ps.gz
Add To MetaCart
Abstract:
By a hybrid theory we mean a theory which is combined from different sub-theories. We present an approach to build-in hybrid theories into theorem provers. Our aim is to obtain a reasoner for a hybrid theory by a possibly simple combination of reasoners dedicated for its constituents. For this purpose we formulate sufficient criterions. This more detailed view on building-in theories is not covered by other general results [2, 3, 4, 7]. The technique described in [7] had to be refined. The method applies to different calculi. As an application we discuss the target language of the algebraic translation of multi-modal logic and extended multi-modal logic [5]. 1
Citations
| 114 | Automated deduction by theory resolution – Stickel - 1985 |
| 21 | Combination Techniques and Decision Problems for Disunification – Baader, Schulz - 1995 |
| 21 | A resolution principle for constrained logics – Burckert - 1994 |
| 16 | Theorem Proving in Large Theories – Reif, Schellhorn - 1997 |
| 8 | Constraint model elimination and a PTTP-implementation – Baumgartner, Stolzenburg - 1995 |
| 6 | Theory Reasoning in Connection Calculi and the Linearizing Completion Approach – Baumgartner - 1997 |
| 6 | Completeness of the pool calculus with an open built in theory – Petermann - 1993 |
| 3 | Multi modal logic programming using equational and order-sorted logic – Debart, Enjalbert, et al. - 1990 |
