The following pages link to Transformations of CLP modules (Q671648):
Displaying 20 items.
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- Transforming constraint logic programs (Q1274969) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs (Q3546042) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- (Q4499254) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
- Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- (Q5015370) (← links)
- (Q5016384) (← links)
- (Q5020652) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Fold/Unfold Transformations for Fixpoint Logic (Q5164174) (← links)
- Inverse Unfold Problem and Its Heuristic Solving (Q5240134) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Q5504662) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
