Transformations of CLP modules

DOI10.1016/0304-3975(95)00148-4zbMath0872.68021OpenAlexW2043140417MaRDI QIDQ671648

Maurizio Gabbrielli, Sandro Etalle

Publication date: 27 February 1997

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

Full work available at URL: https://research.utwente.nl/en/publications/transformations-of-clp-modules(0c082c7d-0561-4663-98aa-4fb6ed9f7b9e).html

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (20)

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses ⋮ Generalization strategies for the verification of infinite state systems ⋮ Solving Horn Clauses on Inductive Data Types Without Induction ⋮ Determinization of conditional term rewriting systems ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Proving correctness of imperative programs by linearizing constrained Horn clauses ⋮ Constraint-based correctness proofs for logic program transformations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Unnamed Item ⋮ Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs ⋮ Predicate Pairing for program verification ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ Transforming constraint logic programs ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ S-semantics for logic programming: a retrospective look ⋮ A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs ⋮ Removing algebraic data types from constrained Horn clauses using difference predicates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composing recursive logic programs with clausal join
• Differential logic programs: Programming methodologies and semantics
• Unfold/fold transformation of stratified programs
• Equivalence-preserving first-order unfold/fold transformation systems
• A transformation system for deductive database modules with perfect model semantics
• Transforming constraint logic programs
• A compositional semantics for logic programs
• Derivation of Logic Programs
• Unfold/fold transformations of logic programs
• A Transformation System for Developing Recursive Programs
• Transformation of logic programs: Foundations and techniques
• Observable Semantics for Constraint Logic Programs
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Partial deduction for structured logic programming

This page was built for publication: Transformations of CLP modules