First order compiler: A deterministic logic program synthesis algorithm

DOI10.1016/S0747-7171(89)80064-1zbMath0693.68017WikidataQ122908310 ScholiaQ122908310MaRDI QIDQ908686

Taisuke Sato, Hisao Tamaki

Publication date: 1989

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

zbMATH Keywords

logic programscompilerdefinite clause programs

Mathematics Subject Classification ID

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

Related Items

Bounded quantifications for iteration and concurrency in logic programming, Implementing constructive intensional negation, Synthesis of positive logic programs for checking a class of definitions with infinite quantification, An equivalence preserving first order unfold/fold transformation system, Equivalence-preserving first-order unfold/fold transformation systems, New Advances in Logic-Based Probabilistic Modeling by PRISM, Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules, Logic program synthesis from first-order logic specifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Making exhaustive search programs deterministic
• A completeness theorem for SLDNF resolution
• Making prolog more expressive
• Negation-as-failure rule for general logic programs with equality
• Derivation of Logic Programs
• A Transformation System for Developing Recursive Programs