Non-disjoint combined unification and closure by equational paramodulation

DOI10.1007/978-3-030-86205-3_2OpenAlexW3197560449MaRDI QIDQ831919

Andrew M. Marshall, Christophe Ringeissen, Serdar Erbatur

Publication date: 24 March 2022

Full work available at URL: https://hal.inria.fr/hal-03329075/file/combi-pc.pdf

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in a combination of arbitrary disjoint equational theories
• Combination techniques and decision problems for disunification
• Syntacticness, cycle-syntacticness and shallow theories
• Unification in the union of disjoint equational theories: Combining decision procedures
• Folding variant narrowing and optimal variant termination
• Terminating non-disjoint combined unification
• Reviving basic narrowing modulo
• Rule-based unification in combined theories and the finite variant property
• Notions of knowledge in combinations of theories sharing constructors
• On Forward Closure and the Finite Variant Property
• Completion of a Set of Rules Modulo a Set of Equations
• Variant-Based Satisfiability in Initial Algebras
• Term Rewriting and All That
• Hierarchical Combination
• Combination techniques for non-disjoint equational theories
• Term Rewriting and Applications
• Term Rewriting and Applications

This page was built for publication: Non-disjoint combined unification and closure by equational paramodulation