The homogeneous form of logic programs with equality

DOI10.1305/NDJFL/1093635423MaRDI QIDQ918967zbMATH OpenOpenAlexFDO

Authors William Demopoulos

Publication date 1990

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093635423

zbMATH Keywords

homogeneous formHorn clause logic programs with equalityminimal Herbrand model

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Review text

Horn clause logic programs with equality are considered. The homogeneous form of such clause sets is introduced. Further, it is assumed that clauses are symmetric, in the sense that if \(s=t\) is head of a clause then there is another analogous clause with \(t=s\). The main interest of the paper lies in the construction of a minimal Herbrand model.

Recommendations

• A theory of complete logic programs with equality
• Prolog: subsumption of equality axioms by the homogeneous form
• Oriented equational clauses as a programming language
• SLDNF-resolution with equality
• Equality, types, modules, and (why not?) generics for logic programming

Cited in

(4)

• A goal-type driven method of solving Horn logic with equality
• Logic programming -- taking advantage of symmetry
• Oriented equational clauses as a programming language
• Prolog: subsumption of equality axioms by the homogeneous form

This page was built for publication: The homogeneous form of logic programs with equality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918967)