A compositional semantic basis for the analysis of equational Horn programs

DOI10.1016/0304-3975(96)00043-6MaRDI QIDQ671509zbMATH OpenOpenAlexWikidataFDO

Authors María Alpuente, M. Falaschi, Germán Vidal

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(96)00043-6

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1761889
• Semantical and computational aspects of Horn approximations
• Horn equational theories and paramodulation
• Publication:4205083
• Horn clauses as an intermediate representation for program analysis and transformation
• Automated Deduction – CADE-20
• The Essentially Equational Theory of Horn Classes
• A compositional semantics for logic programs
• Semantics of Horn and disjunctive logic programs
• Theory and Applications of Satisfiability Testing

Cites work

• scientific article; zbMATH DE number 4209573 (Why is no real title available?)
• scientific article; zbMATH DE number 3921947 (Why is no real title available?)
• scientific article; zbMATH DE number 4053008 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 176721 (Why is no real title available?)
• scientific article; zbMATH DE number 177828 (Why is no real title available?)
• scientific article; zbMATH DE number 512906 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1761889 (Why is no real title available?)
• A theory of complete logic programs with equality
• An abstract concurrent machine for rewriting
• Analyses of unsatisfiability for equational logic programming
• Basic narrowing revisited
• Completeness results for basic narrowing
• Conclog: a methodological approach to concurrent logic programming
• Extending SLD resolution to equational horn clauses using E-unification
• Foundations of equational logic programming
• Incremental constraint satisfaction for equational logic programming
• Narrowing directed by a graph of terms
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Termination of logic programs: the never-ending story
• The integration of functions into logic programming: From theory to practice
• Unification theory

Cited in

(3)

• scientific article; zbMATH DE number 1761889 (Why is no real title available?)
• Functional Logic Programming: From Theory to Curry
• Horn clauses as an intermediate representation for program analysis and transformation

This page was built for publication: A compositional semantic basis for the analysis of equational Horn programs

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