26 pages matching strategy in this book
Results 1-3 of 26
What people are saying - Write a review
We haven't found any reviews in the usual places.
Deductive Synthesis of Programs for Query Answering
Synthesis of Narrowing Programs
13 other sections not shown
abstract interpretation admissible evaluation spaces algorithm applied argument ATMS atoms auxiliary base best-first search Bundy Computation Induction consider contains corresponding deductive deﬁned deﬁnition definition clause delete denote derivation elimination EOLDT structure EOLDT tree equations equivalent example expression finite ﬁrst folding formal formula free variables full Prolog function Functional Programming goal G Horn clauses implementation Incremental Transformation inference rules input input-output goal intensional answers label member(x narrowing nat(X natural number negation NFI-driven Induction 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 result semantics SLD-strict solution table speciﬁcation step strategy Structural Induction subset subset(t substitution tableau techniques termination Theorem Transformation Problem TransfP tuple unary unfolding unify unnecessary variables valid evaluation wave rules yields