Extensions of unification modulo ACUI

DOI10.1017/S0960129519000185zbMath1495.68237OpenAlexW2986211019MaRDI QIDQ5139274

Alexander Okhotin, Antoine Mottet, Franz Baader, Pavlos Marantidis

Publication date: 8 December 2020

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129519000185

zbMATH Keywords

unification theoryACUIapproximate unificationground identities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractable approximate deduction for OWL
• Proximity-based unification theory
• Complexity of unification problems with associative-commutative operators
• On the complexity of the maximum satisfiability problem for Horn formulas
• Unification theory
• Any ground associative-commutative theory has a finite canonical system
• Using automata theory for characterizing the semantics of terminological cycles
• Unification in the union of disjoint equational theories: Combining decision procedures
• Normalized rewriting: An alternative to rewriting modulo a set of equations
• Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
• A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
• Set unification
• Unification in the Description Logic $\mathcal{EL}$
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Term Rewriting and All That
• Matching in the Description Logic FL0 with respect to General TBoxes
• Unification of concept terms in description logics