Incorporating equality into logic programming via surface deduction

DOI10.1016/0168-0072(86)90069-2zbMath0609.68067OpenAlexW2043837816MaRDI QIDQ1087023

P. T. Cox, Tomasz Pietrzykowski

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90069-2

zbMATH Keywords

Horn clausesunificationlogic programmingrefutationflat clausesnon-unifiabilitystandard equalitysurface resolution

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (7)

Incorporating equality into logic programming via surface deduction ⋮ Kernel-LEAF: A logic plus functional language ⋮ Narrowing vs. SLD-resolution ⋮ Conditional equational theories and complete sets of transformations ⋮ Automatic theorem proving. II ⋮ Equality and abductive residua for Horn clauses ⋮ Horn equational theories and paramodulation

Cites Work

• Unnamed Item
• Unnamed Item
• Incorporating equality into logic programming via surface deduction
• Linear unification
• A logical reconstruction of Prolog II

This page was built for publication: Incorporating equality into logic programming via surface deduction