On the complexity of Boolean unification
DOI10.1016/S0020-0190(98)00106-9zbMATH Open1338.68092OpenAlexW1981232804WikidataQ57383729 ScholiaQ57383729MaRDI QIDQ293360FDOQ293360
Authors: Franz Baader 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001069?np=y
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Model theory.
- Title not available (Why is that?)
- Two-Processor Scheduling with Start-Times and Deadlines
- Embedding Boolean expressions into logic programming
- Unification in Boolean rings
- Complexity of Boolean algebras
- A resolution principle for a logic with restricted quantifiers
- Boolean unification - the story so far
- Unification in the union of disjoint equational theories: Combining decision procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unification algorithms cannot be combined in polynomial time
- AC-superposition with constraints: no AC-unifiers needed
- Unification in Boolean rings and Abelian groups
- Unification in a combination of arbitrary disjoint equational theories
Cited In (16)
- Primitivity, uniform minimality, and state complexity of Boolean operations
- Boolean functional synthesis: hardness and practical algorithms
- Algorithmic introduction of quantified cuts
- Towards Parallel Boolean Functional Synthesis
- Title not available (Why is that?)
- On the parameterized complexity of associative and commutative unification
- Boolean unification with predicates
- Title not available (Why is that?)
- Unification in Boolean rings and Abelian groups
- Embedding Boolean expressions into logic programming
- Unification in Boolean rings
- Boolean unification - the story so far
- Lost in translation: language independence in propositional logic -- application to belief change
- Finitariness of elementary unification in Boolean region connection calculus
- On complexity of the anti-unification problem
- Contact logic is finitary for unification with constants
This page was built for publication: On the complexity of Boolean unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293360)
