Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Nieuwenhuis, Albert Oliveras, C. Tinelli (2005)
Abstract DPLL and Abstract DPLL Modulo Theories
S. Ghilardi, Enrica Nicolini, D. Zucchelli (2005)
A Comprehensive Framework for Combined Decision Procedures
F. Baader, S. Ghilardi (2005)
Connecting many-sorted theoriesJournal of Symbolic Logic, 72
H. Friedman (1975)
Equality between functionals
If two full modal i.a.f.'s have decidable constraint satisfiability problems, so does their fusion
(2006)
Received January
Philippe Chenadec (1984)
Canonical forms in finitely presented algebras
J. Lambek, P. Scott (1986)
Introduction to higher order categorical logic
F. Wolter, M. Zakharyaschev (2001)
Decidable fragments of first-order modal logicsJournal of Symbolic Logic, 66
David Cox, J. Little, D. O'Shea (2007)
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
C. Tinelli (2003)
Cooperation of Background Reasoners in Theory Reasoning by Residue SharingJournal of Automated Reasoning, 30
D. Gabbay, Agi Kurucz, F. Wolter, M. Zakharyaschev (2003)
Many-Dimensional Modal Logics: Theory and Applications
F. Baader, S. Ghilardi, C. Tinelli (2004)
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
(2008)
ACM Transactions on Computational Logic
Greg Nelson, D. Oppen (1979)
Simplification by Cooperating Decision ProceduresACM Trans. Program. Lang. Syst., 1
We sketch the little modifications required to prove Proposition 5.12 in the present context (Lemma 5.13 extends trivially)
F. Baader, S. Ghilardi (2005)
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
F. Baader, C. Tinelli (1998)
Deciding the Word Problem in the Union of Equational TheoriesInf. Comput., 178
F. Baader, Diego Calvanese, D. McGuinness, D. Nardi, P. Patel-Schneider (2007)
The Description Logic Handbook
F. Baader, Philipp Hanschke (1991)
A Scheme for Integrating Concrete Domains into Concept Languages
Chang Liu (2000)
The optimal implementation of functional programming languagesACM SIGSOFT Softw. Eng. Notes, 25
maarten marx (2001)
Tolerance LogicJournal of Logic, Language and Information, 10
O. Kutz, C. Lutz, F. Wolter, M. Zakharyaschev (2004)
E-connections of abstract description systemsArtif. Intell., 156
Gilles Dowek (2001)
Higher-Order Unification and Matching
F. Wolter (1996)
Fusions of Modal Logics Revisited
H. Ganzinger, H. Nivelle (1999)
A superposition decision procedure for the guarded fragment with equalityProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
D. Nardi, W. Nutt, F. Donini (2003)
The Description Logic Handbook: Theory, Implementation, and Applications
E. Grädel (1999)
Decision procedures for guarded logicsLecture Notes in Computer Science
F. Baader, C. Lutz, H. Sturm, F. Wolter (2011)
Fusions of Description Logics and Abstract Description SystemsJ. Artif. Intell. Res., 16
(1988)
Algebra, third ed
(1997)
Ideals, Varieties, and Algorithms, 2nd ed. Undergraduate Texts in Mathematics
D. Oppen (1980)
Complexity, Convexity and Combinations of TheoriesTheor. Comput. Sci., 12
C. Tinelli (2002)
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
H. Andréka, I. Németi, J. Benthem (1998)
Modal Languages and Bounded Fragments of Predicate LogicJournal of Philosophical Logic, 27
A. Pitts (1987)
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)Bulletin of The London Mathematical Society, 19
E. Grädel (1999)
Invited Talk: Decision procedures for guarded logics
M. Bozzano, Roberto Bruttomesso, A. Cimatti, Tommi Junttila, Silvio Ranise, P. Rossum, R. Sebastiani (2006)
Efficient theory combination via boolean searchInf. Comput., 204
S. Ghilardi (2004)
Model-Theoretic Methods in Combined Constraint SatisfiabilityJournal of Automated Reasoning, 33
Camillo Fiorentini, S. Ghilardi (2003)
Combining word problems through rewriting in categories with productsTheor. Comput. Sci., 294
C. Fermüller, A. Leitsch, T. Tammet, N. Zamov (1993)
Resolution Methods for the Decision Problem, 679
Peter Andrews (1986)
An introduction to mathematical logic and type theory - to truth through proof
D. Kozen (1982)
Results on the Propositional µ-Calculus
R. Hirsch, I. Hodkinson (2002)
Relation Algebras by Games
M. Rabin (1968)
Decidability of second-order theories and automata on infinite treesBulletin of the American Mathematical Society, 74
P. Odifreddi (1989)
Classical recursion theory
Peter Baumgartner, U. Furbach, U. Petermann (2007)
A Unified Approach to Theory Reasoning
(2005)
Systems Lecture Notes in Computer Science
C. Tinelli, M. Harandi (1996)
A New Correctness Proof of the {Nelson-Oppen} Combination Procedure
M. Bonacina, S. Ghilardi, Enrica Nicolini, Silvio Ranise, D. Zucchelli (2006)
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
E. Börger, E. Grädel, Y. Gurevich (1997)
The Classical Decision Problem
J. Benthem (1983)
Modal logic and classical logic
(2005)
Modularity and refinement in inference systems
Peter Andrews (2001)
Classical Type Theory
S. Ghilardi, L. Santocanale (2003)
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
We define a general notion of a fragment within higher-order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen schema. The procedure is in general only sound, but it becomes terminating and complete when the shared fragment enjoys suitable noetherianity conditions and admits an abstract version of a “Keisler-Shelah-like” isomorphism theorem. We show that this general decidability transfer result covers recent work on combination in first-order theories as well as in various intensional logics such as description, modal, and temporal logics.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Mar 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.