First order compiler: A deterministic logic program synthesis algorithm
From MaRDI portal
DOI10.1016/S0747-7171(89)80064-1zbMATH Open0693.68017WikidataQ122908310 ScholiaQ122908310MaRDI QIDQ908686FDOQ908686
Authors: Taisuke Sato, Hisao Tamaki 
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Artificial intelligence (68T99) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)
Cites Work
- Making prolog more expressive
- Title not available (Why is that?)
- A Transformation System for Developing Recursive Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derivation of Logic Programs
- Title not available (Why is that?)
- A completeness theorem for SLDNF resolution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Making exhaustive search programs deterministic
- Title not available (Why is that?)
- Negation-as-failure rule for general logic programs with equality
- Title not available (Why is that?)
Cited In (11)
- Equivalence-preserving first-order unfold/fold transformation systems
- Implementing constructive intensional negation
- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification
- Bounded quantifications for iteration and concurrency in logic programming
- Title not available (Why is that?)
- 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
- Compiling dyadic first-order specifications into map algebra
- Title not available (Why is that?)
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)
