Compositional analysis for equational Horn programs

DOI10.1007/3-540-58431-5_8MaRDI QIDQ4537508zbMATH OpenFDO

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

Publication date 1 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58431-5_8

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• A compositional semantic basis for the analysis of equational Horn programs
• Analyses of unsatisfiability for equational logic programming
• scientific article; zbMATH DE number 549952
• A compositional semantics for logic programs
• Incremental constraint satisfaction for equational logic programming

Cited in

(5)

• Sensitivity analysis for Horn formulae
• Analyses of unsatisfiability for equational logic programming
• Horn clauses as an intermediate representation for program analysis and transformation
• Termination of Narrowing Using Dependency Pairs
• A compositional semantic basis for the analysis of equational Horn programs

This page was built for publication: Compositional analysis for equational Horn programs

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