Transformation of logic programs: Foundations and techniques

DOI10.1016/0743-1066(94)90028-0MaRDI QIDQ4305629zbMATH OpenOpenAlexFDO

Authors Alberto Pettorossi, Maurizio Proietti

Publication date 14 August 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(94)90028-0

Mathematics Subject Classification ID

Logic programming (68N17)

Cited in

(27)

• An improved reductant calculus using fuzzy partial evaluation techniques
• Transforming constraint logic programs
• Linearisability on Datalog programs
• Rules + strategies for transforming lazy functional logic programs
• Explanations as programs in probabilistic logic programming
• A framework for computing finite SLD trees
• Models and emerging trends of concurrent constraint programming
• Learning efficient logic programs
• Dialectic proof procedures for assumption-based, admissible argumentation
• Optimization schemas for parallel implementation of non-deterministic languages and systems
• A class of rewriting rules and reverse transformation for rule-based equivalent transformation
• Unfold/fold transformations for disjunctive logic programs
• On completeness of logic programs
• On inductive proofs by extended unfold/fold transformation rules
• On Negative Unfolding in the Answer Set Semantics
• Some (in)translatability results for normal logic programs and propositional theories
• Inductive equivalence in clausal logic and nonmonotonic logic programming
• Introduction to the special issue on computational logic for verification
• Predicate pairing for program verification
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Abstracting models from execution traces for performing formal verification
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• An integrated framework for the diagnosis and correction of rule-based programs
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• On transformations into linear database logic programs
• Transformations of CLP modules

This page was built for publication: Transformation of logic programs: Foundations and techniques

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