First order compiler: A deterministic logic program synthesis algorithm

DOI10.1016/S0747-7171(89)80064-1MaRDI QIDQ908686zbMATH OpenWikidataFDO

Authors Taisuke Sato, Hisao Tamaki

Publication date 1989

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

compilerlogic programsdefinite clause programs

Mathematics Subject Classification ID

Artificial intelligence (68T99) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 4106263
• scientific article; zbMATH DE number 970703
• Logic program synthesis from first-order logic specifications
• Synthesis and transformation of logic programs using unfold/fold proofs
• scientific article; zbMATH DE number 1696789

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4164125 (Why is no real title available?)
• scientific article; zbMATH DE number 3980452 (Why is no real title available?)
• scientific article; zbMATH DE number 4033044 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 4106263 (Why is no real title available?)
• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 194907 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A completeness theorem for SLDNF resolution
• Derivation of Logic Programs
• Making exhaustive search programs deterministic
• Making prolog more expressive
• Negation-as-failure rule for general logic programs with equality

Cited in

(11)

• Compiling dyadic first-order specifications into map algebra
• Equivalence-preserving first-order unfold/fold transformation systems
• scientific article; zbMATH DE number 4106263 (Why is no real title available?)
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
• Logic program synthesis from first-order logic specifications
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• An equivalence preserving first order unfold/fold transformation system
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Bounded quantifications for iteration and concurrency in logic programming
• Implementing constructive intensional negation
• scientific article; zbMATH DE number 51768 (Why is no real title available?)

This page was built for publication: First order compiler: A deterministic logic program synthesis algorithm

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