4 search results - page 1 / 1 » Negative Ordered Hyper-Resolution as a Proof Procedure for D... |
FUIN
2006
13 years 4 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
SLP
1993
13 years 6 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
LPKR
1997
Springer
13 years 9 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...