Transformations of CLP modules

DOI10.1016/0304-3975(95)00148-4zbMATH Open0872.68021OpenAlexW2043140417MaRDI QIDQ671648FDOQ671648

Authors: Sandro Etalle, Maurizio Gabbrielli 

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

Recommendations

• scientific article; zbMATH DE number 1332631
• Transforming constraint logic programs
• A rewrite approach for constraint logic programming
• Constraint-based correctness proofs for logic program transformations
• scientific article; zbMATH DE number 1534593

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Transformation of logic programs: Foundations and techniques
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Basic transformation operations which preserve computed answer substitutions of logic programs
• A Transformation System for Developing Recursive Programs
• Title not available (Why is that?)
• A compositional semantics for logic programs
• Title not available (Why is that?)
• 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
• Derivation of Logic Programs
• Unfold/fold transformations of logic programs
• Observable Semantics for Constraint Logic Programs
• Partial deduction for structured logic programming

Cited In (22)

• Transforming constraint logic programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Some (in)translatability results for normal logic programs and propositional theories
• Inverse Unfold Problem and Its Heuristic Solving
• Predicate pairing for program verification
• Title not available (Why is that?)
• Determinization of conditional term rewriting systems
• Generalization strategies for the verification of infinite state systems
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constraint-based correctness proofs for logic program transformations
• S-semantics for logic programming: a retrospective look
• Program Development in Computational Logic
• Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
• Proving correctness of imperative programs by linearizing constrained Horn clauses
• Title not available (Why is that?)
• Removing unnecessary variables from Horn clause verification conditions
• Solving Horn clauses on inductive data types without induction
• Fold/unfold transformations for fixpoint logic
• Removing algebraic data types from constrained Horn clauses using difference predicates

This page was built for publication: Transformations of CLP modules

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