Unification modulo ACUI plus distributivity axioms

DOI10.1007/s10817-004-2279-7zbMath1063.03006OpenAlexW1975341792MaRDI QIDQ1774555

Paliath Narendran, Siva Anantharaman, Michaël Rusinowitch

Publication date: 17 May 2005

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-004-2279-7

zbMATH Keywords

complexitydecidabilityrewritingset constraintscounter machinesautomated deductionPost correspondence problemequational unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (2)

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ Closure properties and decision problems of dag automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in commutative theories
• Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
• Unification problems with one-sided distributivity
• A decision algorithm for distributive unification
• Set constraints and automata
• Haskell overloading is DEXPTIME-complete
• Any ground associative-commutative theory has a finite canonical system
• Generalized definite set constraints
• Set constraints with intersection
• The undecidability of the D_A-unification problem
• Mathematical Foundations of Computer Science 2003
• Automated Deduction – CADE-19
• Unification of concept terms in description logics

This page was built for publication: Unification modulo ACUI plus distributivity axioms