Franz Baader, Cesare Tinelli  Home/Search
Context Related
Links: ACM DBLP | uiowa.edu/combinat...inFROCOS00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiowa.edu/~tinelli/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension broadens the scope of the combination procedure considerably, for example in the direction of equational theories axiomatizing the equivalence of modal formulae. 1 Introduction The word problem for a theory E is concerned with the question of whether two terms are equal in all models of E. In [4] we provided... (Update)
Context of citations to this paper: More
...provided by the new definition of constructors. Because of space limitations, we refer the reader to the longer version of this paper [3] for detailed proofs of our results. 2 Word Problems and Satisfiability Problems We will use V to denote a countably infinite set of...
...to combine decision procedures for the word problem. The paper then presents a method that solves this kind of combination problem. In [11, 12] it is shown that this approach can also be extended to the case of theories sharing constructors. 5 Recall that (X ) denotes the...
Cited by: More
Combining Non-Disjoint Theories - Zarba (2001) (Correct)
Combining Equational Theories Sharing Non-Collapse-Free.. - Baader, Tinelli (1999) (Correct)
Deciding the Word Problem in the Union of Equational Theories - Baader, Tinelli (1999) (Correct)
Similar documents (at the sentence level):
10.7%: Deciding the Word Problem in the Union of Equational Theories .. - Baader, Tinelli (1999) (Correct)
Active bibliography (related documents): More All
0.3: Combining Constraint Solving - Baader, Schulz (2001) (Correct)
0.1: The Complexity of Regularity in Grammar Logics - Demri (2001) (Correct)
0.1: Non-Disjoint Unions of Theories and Combinations of.. - Tinelli, Ringeissen (1998) (Correct)
Similar documents based on text: More All
1.3: Combining Decision Procedures for Positive Theories Sharing.. - Baader, Tinelli (2002) (Correct)
0.4: A New Approach for Combining Decision Procedures for the Word .. - Baader, Tinelli (1997) (Correct)
0.4: A New Combination Procedure for the Word Problem that.. - Baader, Ghilardi.. (2004) (Correct)
Related documents from co-citation: More All
5: Combination techniques for non-disjoint equational theories - Domenjoud, Klay et al. - 1994
5: Combination of constraint solvers for free and quasi-free structures (context) - Baader, Schulz - 1998
3: Combining matching algorithms: The regular case (context) - Nipkow - 1991
BibTeX entry: (Update)
F. Baader and C. Tinelli. Combining equational theories sharing non-collapse-free constructors. TR 99-13, Dept. of Computer Science, University of Iowa, 1999. http://citeseer.ist.psu.edu/article/baader99combining.html More
@inproceedings{ baader00combining,
author = "F. Baader and C. Tinelli",
title = "Combining Equational Theories Sharing Non-Collapse-Free Constructors",
booktitle = "Proceedings of the 3rd International Workshop on Frontiers of Combining Systems (FroCoS 2000)",
volume = "1794",
publisher = "Springer-Verlag",
address = "Nancy, France",
editor = "H.~Kirchner and Ch.~Ringeissen",
pages = "257--271",
year = "2000",
url = "citeseer.ist.psu.edu/article/baader99combining.html" }
Citations (may not include all citations):44 Combination techniques for nondisjoint equational theories - Domenjoud, Klay et al. - 1994
30 Combining matching algorithms: The regular case (context) - Nipkow - 1989 ACM DBLP
28 Combination of constraint solvers for free and quasifree str.. (context) - Baader, Schulz - 1998
26 Combination of unification algorithms (context) - Schmidt-Schau - 1989 ACM DBLP
21 Tools and Techniques in Modal Logic (context) - Kracht - 1999
21 Unification of concept terms in description logics - Baader, Narendran - 1998 ACM DBLP
20 General theory of Boolean algebras (context) - Koppelberg - 1988
17 The join of equational theories (context) - Pigozzi - 1974
17 Simulation and transfer results in modal logic: A survey (context) - Kracht, Wolter - 1997
15 Algebraic semantics for modal logics (context) - Lemmon - 1966
9 Complexity transfer for modal logic (context) - Hemaspaandra - 1994
5 Combining equational theories sharing non-collapse-free cons.. - Baader, Tinelli - 1999 ACM DBLP
The graph only includes citing articles where the year of publication is known.
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