Associative-commutative unification
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885353 (Why is no real title available?)
- scientific article; zbMATH DE number 3921983 (Why is no real title available?)
- scientific article; zbMATH DE number 3930337 (Why is no real title available?)
- scientific article; zbMATH DE number 3945372 (Why is no real title available?)
- scientific article; zbMATH DE number 4049025 (Why is no real title available?)
- scientific article; zbMATH DE number 4049130 (Why is no real title available?)
- scientific article; zbMATH DE number 3590511 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A Unification Algorithm for Associative-Commutative Functions
- An Efficient Unification Algorithm
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- Complete Sets of Reductions for Some Equational Theories
- Complete sets of unifiers and matchers in equational theories
- Hilbert's Tenth Problem is Unsolvable
- On the sequential nature of unification
Cited in
(36)- A new method for undecidability proofs of first order theories
- Competing for the \(AC\)-unification race
- A general refutational completeness result for an inference procedure based on associative-commutative unification
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Building Theorem Provers
- Unification algorithms cannot be combined in polynomial time
- scientific article; zbMATH DE number 4043300 (Why is no real title available?)
- Open problems in rewriting
- Associative unification and symbolic reasoning modulo associativity in Maude
- An algebraic approach to unification under associativity and commutativity
- scientific article; zbMATH DE number 3930337 (Why is no real title available?)
- Permutative rewriting and unification
- AC-unification race: The system solving approach, implementation and benchmarks
- Adventures in associative-commutative unification
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- Unification in abelian semigroups
- scientific article; zbMATH DE number 3866609 (Why is no real title available?)
- Unification algorithms cannot be combined in polynomial time.
- On pot, pans and pudding or how to discover generalised critical pairs
- Efficient solution of linear diophantine equations
- Unification in permutative equational theories is undecidable
- scientific article; zbMATH DE number 3871322 (Why is no real title available?)
- Complexity of unification problems with associative-commutative operators
- On nominal syntax and permutation fixed points
- On the parameterized complexity of associative and commutative unification
- “Syntactic” AC-unification
- AC-complete unification and its application to theorem proving
- On the unification problem for Cartesian closed categories
- On the parameterized complexity of associative and commutative unification
- A formalisation of nominal C-matching through unification with protected variables
- Solving word equations
- Nominal AC-matching
- A formally verified solver for homogeneous linear Diophantine equations
- scientific article; zbMATH DE number 4074540 (Why is no real title available?)
- Formalising nominal C-unification generalised with protected variables
- Unification in Boolean rings and Abelian groups
This page was built for publication: Associative-commutative unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099648)
