Analyses of unsatisfiability for equational logic programming

DOI10.1016/0743-1066(94)00024-ZMaRDI QIDQ4327430zbMATH OpenDBLPWikidataFDO

Authors Ferdinando Manzo, María Alpuente, M. Falaschi

Publication date 6 April 1995

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(94)00024-Z

zbMATH Keywords

equational logic programmingabstract narrower

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1761889
• A compositional semantic basis for the analysis of equational Horn programs
• Unification modulo an equality theory for equational logic programming
• Narrowing based procedures for equational disunification
• Combining Logic Programming and Equation Solving

Cited in

(10)

• A Scalable Inclusion Constraint Solver Using Unification
• Termination of narrowing revisited
• An integrated framework for the diagnosis and correction of rule-based programs
• Towards a Semantics of Unsatisfiability Proofs with Inprocessing
• scientific article; zbMATH DE number 1761889 (Why is no real title available?)
• A debugging scheme for functional logic programs
• Functional Logic Programming: From Theory to Curry
• A compositional semantic basis for the analysis of equational Horn programs
• Loop detection in term rewriting using the eliminating unfoldings
• Declarative debugging of functional logic programs

Describes a project that uses

Uses Software

• BABEL

This page was built for publication: Analyses of unsatisfiability for equational logic programming

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