Complexity of unification problems with associative-commutative operators
From MaRDI portal
(Redirected from Publication:688565)
Recommendations
- On the parameterized complexity of associative and commutative unification
- On the parameterized complexity of associative and commutative unification
- Associative-commutative unification
- scientific article; zbMATH DE number 3871322
- Adventures in associative-commutative unification
- scientific article; zbMATH DE number 4074540
- An algebraic approach to unification under associativity and commutativity
- scientific article; zbMATH DE number 3930337
- Unifications, deunifications, and their complexity
- Complexity of nilpotent unification and matching problems.
Cites work
- scientific article; zbMATH DE number 3871322 (Why is no real title available?)
- scientific article; zbMATH DE number 3930337 (Why is no real title available?)
- scientific article; zbMATH DE number 3930347 (Why is no real title available?)
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3330761 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- A Unification Algorithm for Associative-Commutative Functions
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Complete Sets of Reductions for Some Equational Theories
- Complexity of matching problems
- Linear unification
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Matching, unification and complexity
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Unification in varieties of idempotent semigroups
- Unification problems with one-sided distributivity
- Unification theory
Cited in
(32)- Unification algorithms cannot be combined in polynomial time.
- What is essential unification?
- On the parameterized complexity of associative and commutative unification
- Combination techniques and decision problems for disunification
- On the parameterized complexity of associative and commutative unification
- Cancellative Abelian monoids and related structures in refutational theorem proving. I
- On the unification problem for Cartesian closed categories
- A formalisation of nominal C-matching through unification with protected variables
- scientific article; zbMATH DE number 4043300 (Why is no real title available?)
- Unification theory
- \(E\)-unification with constants vs. general \(E\)-unification
- Complexity of nilpotent unification and matching problems.
- Generating languages by a derivation procedure for elementary formal systems
- Unification and matching modulo nilpotence
- Extending unification in \(\mathcal{EL}\) to disunification: the case of dismatching and local disunification
- More problems in rewriting
- scientific article; zbMATH DE number 4164133 (Why is no real title available?)
- An algorithm for distributive unification
- Approximate unification in the description logic \(\mathcal {FL}_0\)
- NP-completeness results for deductive problems on stratified terms
- Formalising nominal C-unification generalised with protected variables
- The complexity of counting problems in equational matching
- An efficient labelled nested multiset unification algorithm
- Extensions of unification modulo ACUI
- AC-superposition with constraints: no AC-unifiers needed
- scientific article; zbMATH DE number 1929957 (Why is no real title available?)
- On complexity of the anti-unification problem
- Variant-Based Satisfiability in Initial Algebras
- Type dependencies for logic programs using ACI-unification
- scientific article; zbMATH DE number 4074540 (Why is no real title available?)
- Combination techniques and decision problems for disunification
- Object-level reasoning with logics encoded in HOL Light
This page was built for publication: Complexity of unification problems with associative-commutative operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688565)
