Transformation rules for locally stratified constraint logic programs

DOI10.1007/978-3-540-25951-0_10MaRDI QIDQ5712537zbMATH OpenOpenAlexFDO

Authors Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti

Publication date 23 December 2005

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

Full work available at URL https://doi.org/10.1007/b98187, http://hdl.handle.net/2108/32813

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Transforming constraint logic programs
• Perfect model checking via unfold/fold transformations
• Unfold/fold transformation of stratified programs
• Transformations of CLP modules
• Transforming normal logic programs to constraint logic programs

Cited in

(10)

• Transforming normal logic programs to constraint logic programs
• Transforming constraint logic programs
• Removing algebraic data types from constrained Horn clauses using difference predicates
• Perfect model checking via unfold/fold transformations
• On inductive proofs by extended unfold/fold transformation rules
• A Transformational Approach for Proving Properties of the CHR Constraint Store
• On Negative Unfolding in the Answer Set Semantics
• Inverse Unfold Problem and Its Heuristic Solving
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

This page was built for publication: Transformation rules for locally stratified constraint logic programs

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