Combination problems for commutative/monoidal theories or how algebra can help in equational unification
DOI10.1007/BF01195536zbMATH Open0853.03008OpenAlexW2004460530MaRDI QIDQ1919702FDOQ1919702
Authors: Franz Baader, Werner Nutt
Publication date: 6 January 1997
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01195536
Recommendations
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification
- Variations on algebra: Monadicity and generalisations of equational theories
- Term Rewriting and Applications
- An algebraic approach to unification under associativity and commutativity
- scientific article; zbMATH DE number 3930337
- scientific article; zbMATH DE number 3889503
- Commutants for enriched algebraic theories and monads
- Adventures in associative-commutative unification
- scientific article; zbMATH DE number 4074540
- Unions of Equational Monadic Theories
algorithmsequational theoriesAbelian groupscommutative theoriesAbelian monoidsequational unificationmonoidal theoriessemiadditive categoriessystems of linear equations over a semiring
Symbolic computation and algebraic computation (68W30) Equational classes, universal algebra in model theory (03C05) Semirings (16Y60) Applications of universal algebra in computer science (08A70) Preadditive, additive categories (18E05)
Cites Work
- Algebraic semantics for modal logics I
- Title not available (Why is that?)
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated deduction by theory resolution
- Complete Sets of Reductions for Some Equational Theories
- Unification in a combination of arbitrary disjoint equational theories
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Title not available (Why is that?)
- Unification in commutative theories
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Completion of a Set of Rules Modulo a Set of Equations
- Basic narrowing revisited
- A Human Oriented Logic for Automatic Theorem-Proving
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of complete logic programs with equality
- Extending SLD resolution to equational horn clauses using E-unification
- Complete sets of transformations for general E-unification
- The unification hierarchy is undecidable
Cited In (18)
- Unification of concept terms in description logics
- Composition with Algebra at the Background
- Restricted unification in the DL \(\mathcal{FL}_0\)
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification
- Decidability and combination results for two notions of knowledge in security protocols
- Filtering unification and most general unifiers in modal logic
- Unification in commutative theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unions of Equational Monadic Theories
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification
- Unification in monoidal theories
- Unification properties of commutative theories: a categorical treatment
- Title not available (Why is that?)
- Symbolic protocol analysis for monoidal equational theories
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Title not available (Why is that?)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
This page was built for publication: Combination problems for commutative/monoidal theories or how algebra can help in equational unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919702)