Franz Baader  Home/Search
Context Related
Links: ACM DBLP | lti.informatik.rwt...rLTCS9703.ps.gz lti.informatik.rwt...rLTCS9703.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: ps.unisb.de/ccl/publicati...1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Unification modulo the theory of Boolean algebras has been investigated by several autors. Nevertheless, the exact complexity of the decision problem for unification with constants and general unification was not known. In this research note, we show that the decision problem is \Pi p 2 - complete for unification with constants and PSPACE-complete for general unification. In contrast, the decision problem for elementary unification (where the terms to be unified contain only symbols of the... (Update)
Context of citations to this paper: More
.... complete for elementary unification, Pi p 2 complete for unification with constants, and PSPACE complete for general unification [Baader 1998]. Unification type: The theory CRU is of unification type zero, even for elementary unification [Franzen 1992] BR is unitary for...
Cited by: More
Unification Theory - Baader, Snyder (1999) (Correct)
Active bibliography (related documents): More All
0.2: A criterion for intractability of E-unification with free.. - Schulz (Correct)
0.2: Combining Unification- and Disunification Algorithms - Tractable.. - Schulz (1996) (Correct)
0.2: Relation Algebras for Reasoning about Time and Space - Maddux (1993) (Correct)
Similar documents based on text: More All
0.3: Unification in a Description Logic with Inconsistency and.. - Baader, Küsters (2002) (Correct)
0.3: Extending First-Order Unification by Tractable Second-Order.. - Gramlich (2000) (Correct)
0.2: A New Approach for Combining Decision Procedures for the Word .. - Baader, Tinelli (1997) (Correct)
Related documents from co-citation: More All
2: Associative-commutative unification (context) - Fages - 1984
2: Worst-case complexity bounds on algorithms for computing the canonical structure.. (context) - Iliopoulos
2: Complete sets of unifiers and matchers in equational theories (context) - Fages, Huet - 1983
BibTeX entry: (Update)
Baader F. [1998], `On the complexity of Boolean unification', Information Processing Letters 67(4), 215--220. http://citeseer.ist.psu.edu/article/on97complexity.html More
@techreport{ baader99complexity,
author = "F. Baader",
title = "On the Complexity of Boolean Unification",
number = "97-03",
month = "20,",
year = "1999",
url = "citeseer.ist.psu.edu/article/on97complexity.html" }
Citations (may not include all citations):686 A Guide to the Theory of NP-completeness (context) - Garey, Johnson et al. - 1979
561 Constraint logic programming (context) - Jaffar, Lassez - 1987 ACM DBLP
165 Theoretical Computer Science (context) - Kozen, Boolean - 1980
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
71 Unification in the union of disjoint equational theories: Co.. - Baader, Schulz - 1996 ACM DBLP
30 Unification in a combination of arbitrary disjoint equationa.. (context) - Schmidt-Schauss - 1989 ACM DBLP
23 Embedding Boolean expressions into logic programming (context) - Buttner, Simonis - 1987 ACM DBLP
23 volume 73 of Studies in Logic and the Foundations of Mathema.. (context) - Chang, Keisler et al. - 1990
22 A Resolution Principle for a Logic with Restricted Quantifie.. (context) - Burckert - 1991
21 Boolean unification---The story so far (context) - Martin, Nipkow - 1989
19 Constrained equational reasoning (context) - Kirchner, Kirchner - 1989 ACM DBLP
14 Unification in Boolean rings (context) - Martin, Nipkow - 1989
12 Boolean Functions and Equations (context) - Rudeanu - 1974
8 Unification in Boolean rings and Abelian groups (context) - Boudet, Jouannaud et al. - 1989 ACM DBLP
7 Using an Extended Prolog for Digital Circuit Design (context) - Simonis, Dincbas - 1987
4 Unification algorithms cannot be combined in polynomial time - Hermann, Kolaitis - 1996
4 The Mathematical Analysis of Logic: Being an Essay towards a.. (context) - Boole
1 Uber das Auflosungsproblem im logischen Klassenkalkul (context) - Lowenheim - 1908
1 AC-supperposition with constraints: No ACunifiers needed (context) - Nieuwenhuis, Rubio - 1990
Documents on the same site (http://www.ps.uni-sb.de/ccl/publications/1997.html): More
Automatic Termination Analysis of Logic Programs (with.. - Lindenstrauss, Sagiv (Correct)
Grid Structures and Undecidable Constraint Theories - Seynhaeve, Tommasi, Treinen (1997) (Correct)
Solving Classes of Set Constraints with Tree Automata - Devienne, Talbot, Tison (1997) (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