Narrowing based procedures for equational disunification

DOI10.1007/BF01189020zbMath0752.68048MaRDI QIDQ1197097

Maribel Fernández

Publication date: 16 January 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

equationsnarrowingdisunificationdisequations

Mathematics Subject Classification ID

Artificial intelligence (68T99) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (6)

On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Constraint functional logic programming over finite domains ⋮ A metamodel of access control for distributed environments: applications and properties ⋮ On solving nominal disunification constraints ⋮ Pumping, cleaning and symbolic constraints solving ⋮ Nominal equational problems

Uses Software

• NARROWER

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Proofs by induction in equational theories with constructors
• On sufficient-completeness and related properties of term rewriting systems
• Automatic proofs by induction in theories without constructors
• Sufficient-completeness, ground-reducibility and their complexity
• Semantic confluence tests and completion methods
• Abstract Data Type Specification in the Affirm System
• Programming with equalities, subsorts, overloading, and parametrization in OBJ
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Narrowing based procedures for equational disunification