Equivalence-preserving first-order unfold/fold transformation systems

DOI10.1016/0304-3975(92)90287-PzbMath0798.68101OpenAlexW1532674857MaRDI QIDQ1200980

Taisuke Sato

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90287-p

zbMATH Keywords

three-valued logiclogic programmingfirst-order programsunfold/fold transformation systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (8)

Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ Determinization of conditional term rewriting systems ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Transformations of CLP modules ⋮ BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ A semantics for modular general logic programs ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strict completion of logic programs
• First order compiler: A deterministic logic program synthesis algorithm
• Equational problems and disunification
• A completeness theorem for SLDNF resolution
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• Completed logic programs and their consistency
• Making prolog more expressive
• Negation in logic programming
• Derivation of Logic Programs
• A Transformation System for Developing Recursive Programs
• A transformational approach to negation in logic programming

This page was built for publication: Equivalence-preserving first-order unfold/fold transformation systems