A compositional semantic basis for the analysis of equational Horn programs

DOI10.1016/0304-3975(96)00043-6zbMATH Open0872.68107OpenAlexW2144678770WikidataQ57978309 ScholiaQ57978309MaRDI QIDQ671509FDOQ671509

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

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completeness results for basic narrowing
• Unification theory
• Basic narrowing revisited
• Title not available (Why is that?)
• Foundations of equational logic programming
• The integration of functions into logic programming: From theory to practice
• Analyses of unsatisfiability for equational logic programming
• Conclog: a methodological approach to concurrent logic programming
• Incremental constraint satisfaction for equational logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of complete logic programs with equality
• Title not available (Why is that?)
• Extending SLD resolution to equational horn clauses using E-unification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination of logic programs: the never-ending story
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Title not available (Why is that?)
• Narrowing directed by a graph of terms
• An abstract concurrent machine for rewriting

Cited In (3)

• Title not available (Why is that?)
• 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)