(Enter summary)
Abstract: Previous results for combining decision procedures for the word problem in the
non-disjoint case do not apply to equational theories induced by modal logics---which
are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability
results for the fusion of modal logics are strongly tailored towards the special theories
at hand, and thus do not generalize to other types of equational theories. (Update)
Cited by: More
A New Combination Procedure for the Word Problem that.. - Baader, Ghilardi.. (2004)
(Correct)
Active bibliography (related documents): More All
1.1: Algebraic and Model Theoretic Techniques for Fusion.. - Ghilardi, Santocanale (2003)
(Correct)
0.5: Reasoners' Cooperation and Quantifier Elimination - Ghilardi (2003)
(Correct)
0.5: Deciding the Word Problem in the Union of Equational Theories - Baader (1999)
(Correct)
Similar documents based on text: More All
0.2: Deciding the Word Problem in the Union of Equational Theories .. - Baader, Tinelli (1999)
(Correct)
0.2: Combining Equational Theories Sharing Non-Collapse-Free.. - Baader, Tinelli (1999)
(Correct)
0.2: Combining Decision Procedures for Positive Theories Sharing.. - Baader, Tinelli (2002)
(Correct)
BibTeX entry: (Update)
F. Baader, S. Ghilardi, and C. Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Technical Report 03-03, Department of Computer Science, The University of Iowa, December 2003. http://citeseer.ist.psu.edu/article/baader03new.html More
@misc{ baader03new,
author = "F. Baader and S. Ghilardi and C. Tinelli",
title = "A new combination procedure for the word problem that generalizes fusion
decidability results in modal logics",
text = "F. Baader, S. Ghilardi, and C. Tinelli. A new combination procedure for
the word problem that generalizes fusion decidability results in modal logics.
Technical Report 03-03, Department of Computer Science, The University of
Iowa, December 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/baader03new.html" }
Citations (may not include all citations):
353
Term Rewriting and All That (context) - Baader, Nipkow - 1998
240
A guide to completeness and complexity for modal logics of k.. (context) - Halpern, Moses - 1992
190
Results on the propositional -calculus (context) - Kozen - 1983
154
Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
126
Semantical considerations on floyd-hoare logic
- Pratt - 1976
113
Cambridge University Press (context) - Chellas, an - 1980
57
Qualifying number restrictions in concept languages (context) - Hollunder, Baader - 1991
54
Many-Dimensional Modal Logics: Theory and Applications (context) - Gabbay, Kurucz et al. - 2003
49
Properties of independently axiomatizable bimodal logics (context) - Kracht, Wolter - 1991
44
Combination techniques for non-disjoint equational theories
- Domenjoud, Klay et al. - 1994
39
not never' revisited: On branching versus linear time tempor.. (context) - Emerson, Halpern - 1986
31
An Algebraic Approach to Non-Classical Logics (context) - Rasiowa - 1974
31
the expressivity of feature logics with negation (context) - Baader, Burckert et al. - 1993
31
Extensions of concept languages for a mechanical engineering.. (context) - Baader, Hanschke - 1992
30
Combining matching algorithms: The regular case (context) - Nipkow - 1991
29
An Essay in Classical Modal Logic (context) - Segerberg - 1971
23
Unions of non-disjoint theories and combinations of satisfia..
- Tinelli, Ringeissen - 2003
23
Design and synthesis of synchronisation skeletons usin branc.. (context) - Clarke, Emerson - 1982
23
University of Missouri Press (context) - Balbes, Dwinger - 1974
22
Fusions of description logics and abstract description syste..
- Baader, Lutz et al. - 2002
22
Fusions of modal logics revisited
- Wolter - 1998
21
Department of Mathematics and Computer Science (context) - Spaan, Modal et al. - 1993
21
Boolean unification---The story so far (context) - Martin, Nipkow - 1989
20
A new approach for combining decision procedures for the wor..
- Baader, Tinelli - 1997
17
The join of equational theories (context) - Pigozzi - 1974
17
A PSPACE algorithm for graded modal logic
- Tobies - 1999
16
Deciding the word problem in the union of equational theorie..
- Baader, Tinelli - 2002
15
Combining satisfiability procedures by equality-sharing (context) - Nelson - 1984
14
volume 35 of Oxford Logic Guides (context) - Chagrov, Zakharyaschev - 1997
11
volume 38 of Oxford Logic Guides (context) - Gabbay - 1999
11
volume 28 of Oxford Logic Guides (context) - Gabbay, Hodkinson et al. - 1994
9
Unification in a combination of arbitrary disjoint equationa.. (context) - Schmidt-Schau - 1989
6
Graded modalities (context) - Fattorosi-Barnaba, De Caro - 1985
6
Amsterdam-London (context) - Chang, Keisler et al. - 1990
6
Combining word problems through rewriting in categories with.. (context) - Fiorentini, Ghilardi - 2003
5
Quantifier elimination and provers integration (context) - Ghilardi - 2003
4
First-Order Unification in Combinations of Equational Theori.. (context) - Tiden - 1986
3
Algebraic and model theoretic techniques for fusion decidabi..
- Ghilardi, Santocanale - 2003
2
Logic and Computation (context) - Van der Hoek, de Rijke - 1995
2
Kluwer Academic Publishers (context) - Ghilardi, Zawadowski et al. - 2002
Documents on the same site (http://cs.uiowa.edu/~tinelli/papers.html): More
A New Approach for Combining Decision Procedures for the Word .. - Baader, Tinelli (1997)
(Correct)
Combining Equational Theories Sharing Non-Collapse-Free.. - Baader, Tinelli (1999)
(Correct)
Constraint Logic Programming over Unions of Constraint Theories - Tinelli, Harandi (1998)
(Correct)
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