Transformations of CLP modules
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4053011 (Why is no real title available?)
- scientific article; zbMATH DE number 1158761 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- A compositional semantics for logic programs
- A transformation system for deductive database modules with perfect model semantics
- Basic transformation operations which preserve computed answer substitutions of logic programs
- Composing recursive logic programs with clausal join
- Derivation of Logic Programs
- Differential logic programs: Programming methodologies and semantics
- Equivalence-preserving first-order unfold/fold transformation systems
- Observable Semantics for Constraint Logic Programs
- Partial deduction for structured logic programming
- Transformation of logic programs: Foundations and techniques
- Transforming constraint logic programs
- Unfold/fold transformation of stratified programs
- Unfold/fold transformations of logic programs
- Unfold⧸fold transformation of general logic programs for the well-founded semantics
Cited in
(22)- Transforming constraint logic programs
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Some (in)translatability results for normal logic programs and propositional theories
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
- Inverse Unfold Problem and Its Heuristic Solving
- Predicate pairing for program verification
- scientific article; zbMATH DE number 7453193 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1497831 (Why is no real title available?)
- Constraint-based correctness proofs for logic program transformations
- scientific article; zbMATH DE number 7444023 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1615260 (Why is no real title available?)
- 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)