What people are saying - Write a review
We haven't found any reviews in the usual places.
Logic Program Synthesis via Proof Planning
Deductive Synthesis of Programs for Query Answering
Synthesis of Narrowing Programs
14 other sections not shown
Other editions - View all
abstract interpretation admissible evaluation spaces algorithm applied argument ATMS atoms auxiliary definitions base best-first search Bundy Computation Induction consider contains corresponding deductive defined definition clause delete denote derivation elimination EOLDT structure EOLDT tree equations equivalent example expression finite folding formal formula free variables full Prolog Functional Programming goal G Horn clauses implementation Incremental Transformation inference rules input input-output goal intensional answers label logic programs narrowing nat(X negation NFI-driven Induction NG-ATMS node obtained occurring operations output partial evaluation predicate symbol Proc procedure program synthesis program transformation Prolog programs proof nets proof planning properties pure logic program query reachability recursive relational algebra relational calculus replace representation residual program RestofP result semantics SLD-strict solution table specification step strategy Structural Induction subset substitution tableau techniques termination Theorem Transformation Problem TransfP tuple unfolding unify unnecessary variables valid evaluation wave rules yields