A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A completeness theorem for SLDNF resolution
1989
The Journal of Logic Programming
Preserved Fulltext
theorems for the completeness of SLDNF resolution and negation as failure. ...
This corresponding theorem is proved by a mutual induction with the proof of the completeness of SLDNF resolution. ...
doi:10.1016/0743-1066(89)90020-4
fatcat:w6vfwzip6jaefc7dmdub7y3pmm
A sound and complete semantics for a version of negation as failure
1989
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Negation as failure is sound both for the closed world assumption and the completed database or completion, comp( P) of a program ?? ...
By extending the negation as failure rule we exclude floundering and we give a semantics Fw( P) for which the extended rule is both sound and complete. ...
I am grateful to Gerhard Jliger for helpful discussions and to Robert Stgrk for pointing out mistakes in, and making corrections to, an earlier version. ...
doi:10.1016/0304-3975(89)90106-0
fatcat:aynfzqntfvcm7ipepl2necsvri
Completeness of SLDNF-resolution for nonfloundering queries
1996
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
DRABENT ~> SLDNF-resolution is a standard operational semantics for negation as (finite) failure. ...
The existing papers study syntactic classes of programs and goals for which SLDNF-resolution is complete. ...
For every such class, there exist programs and goals that do not belong to the class, but for which SLDNF-resolution is complete. These completeness theorems have a similar form. ...
doi:10.1016/0743-1066(95)00118-2
fatcat:jldtzfaneje2xo3idwi3ammxoe
ON THE PROPOSITIONAL SLDNF-RESOLUTION
1996
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. ...
We de ne notions of constructive transformation and constructive completion of a program. ...
Acknowledgments I would like to express my thanks to NSF for partial support of this research with grant IRI 9308970. ...
doi:10.1142/s0129054196000269
fatcat:6uka5ltzhjestbvvwdhimu6je4
Acyclic logic programs and the completeness of SLDNF-resolution
1991
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We prove completeness of SLDNF-resolution for the acyclic programs and discuss several other desirable properties exhibited by programs belonging to this class. ...
., Acyclic logic programs and the completeness of SLDNF-resolution, Theoretical Computer Science 86 (1991) 81-92. ...
Acknowledgment I would like to thank the referees for suggestions on presentation. ...
doi:10.1016/0304-3975(91)90005-m
fatcat:6wnjq5ao6fhpxinwt6xu6ckfci
Logic programming and negation: A survey
1994
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Call the resulting notion SLDNFE resolution (for SLDNF afended). Then for the SLDNFE resolution, the Soundness Theorem (Theorem 4.16) still holds. ...
Thus the value of the completeness results for SLDNF resolution, stating the existence of a successful SLDNF tree, is limited. ...
doi:10.1016/0743-1066(94)90024-8
fatcat:krg2a4l2zbdqlftzysdsszfj64
A direct proof of the completeness of SLDNF-resolution
1999
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We give a direct proof of the following theorem: If a goal Gσ is a logical consequence of the partial completion of an arbitrary normal logic program P , then each fair, non-floundering SLDNF-tree T for ...
If the negation G is a logical consequence of the partial completion of P , then T is finitely failed. ...
Introduction Most completeness proofs for SLDNF-resolution are of the following kind: if a goal G and a logic program P have the property that each SLDNF-tree for G with respect to P is non-floundering ...
doi:10.1093/logcom/9.1.47
fatcat:wdr2ru27rraizkjv3mdlpfihoe
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
1996
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The SLDNF resolution (SLD resolution with negation as failure) is often restricted to yield a safe rule, that is, negation as failure rule is adopted only in the case that the selected negative literal ...
Since Shepherdson's proposal is thought of as most general [ 16, 181 we formally show how the success and failure sets by Sherpherdson's SLDNFS resolution are related with a fixpoint semantics, which is ...
The completeness of the SLDNF resolution with respect to the logical consequence of Clark's completion of a general logic program (database) has been investigated in 3-valued logic. ...
doi:10.1016/0304-3975(95)00109-3
fatcat:ve2ndwvhvzapfapo2cl6bp3cj4
A class of programs for which SLDNF resolution and NAF rule are complete
1993
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
., A class of programs for which SLDNF resolution and NAF rule are complete, Theoretical Computer Science 120 (1993) 83-99. ...
Then one can apply Kunen's 3-valued completeness theorem in order to get a 2-valued completeness result ...
of SLDNF resolution and NAF holds with respect to the program completion. ...
doi:10.1016/0304-3975(93)90246-p
fatcat:yfii4e64w5gx5hlacplbmvdtpu
Partial evaluation in logic programming
1991
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
For the procedural semantics, we show that, if P' U {G) is A-closed and A is independent, then P' is sound and complete wrt P for the goal G. ...
We study, for both the declarative and procedural semantics, conditions under which P' is sound and complete wrt P for the goal G. ...
Under assumptions which ensure the completeness of SLDNF-resolution (for example, allowedness and strictness [4,17]), we can use the completeness result of the next section (Theorem 4.3) to obtain a completeness ...
doi:10.1016/0743-1066(91)90027-m
fatcat:xlmf5uqv6faipgif3yyw3p6v2a
CUT-PROPERTY AND NEGATION AS FAILURE
1994
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
It turns out that this version of SLDNF-resolution is sound and complete with respect to three-valued possible world models of the completion for arbitrary logic programs and arbitrary goals. ...
A fragment of the sequent calculus leads to a sound and complete semantics for SLDNFresolution with substitutions. ...
We show that SLDNF-resolution is sound and complete for decomposable programs with respect to three-valued models of the completion. This theorem extends the completeness results of [3, 13, 18] . ...
doi:10.1142/s0129054194000086
fatcat:7zjkc7brtvcd3nl4jpjzytgtxa
A new definition of SLDNF-resolution
1994
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
COMPARISON WITH KUNEN'S DEFINITION The difficulty of defining SLDNF-resolution was elegantly circumvented in Kunen 171, where a completeness theorem of SLDNF-resolution for allowed general programs and ...
Theorem 4. 3 . 3 If C is a query, then: l CRT iff 7 is a c.a.s. for C. ...
doi:10.1016/0743-1066(94)90051-5
fatcat:cylvmajoifainkfktpxvsb75ji
Page 440 of Mathematical Reviews Vol. , Issue 91A
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It defines a deduction procedure, called ENF deduction (for extended negation as failure) which generalizes SLDNF resolution, since any goal provable by SLDNF resolution is provable by ENF deduction. ...
Therefore the completeness results holding for SLDNF resolution also hold for ENF deduction. Our results improve previous results of R. Barbuti, P. Mancarella, D. Pedreschi and F. ...
The notion of floundering for SLDNF-resolution revisited
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Moreover, with a result from Drabent ( Dra94]), extended SLDNF-resolution is complete wrt Kunen semantics for non true oundering programs and goals, which corresponds to a large class of normal programs ...
SLDNF-resolution is the standard operational semantics for normal programs. Its safeness condition induces a notion of oundering which may be considered as a programming error. ...
Acknowledgements The author would like to thank Wlodzimierz Drabent for his comments on a draft version of this paper. ...
doi:10.1007/bfb0026831
fatcat:tvnbddi2efaknopfvwvbuppjou
Intensional Query Answering: An Application of Partial Evaluation
[chapter]
1993
Logic Program Synthesis and Transformation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We show that in the SLDNF-resolution framework, complete and procedurally complete sets of intensional answers can be generated by using partial evaluation. ...
We consider intensional answers to be logical formulas expressing sufficient conditions for objects to belong to the usual answer to a query addressed to a knowledge base. ...
The result of such a transformation is logically equivalent to the original formula, by Clark's Lemma (cf. [Clark78] , also Lemma 15.2 in [Lloyd87] ). ...
doi:10.1007/978-1-4471-3560-9_10
dblp:conf/lopstr/Giacomo92
fatcat:cetgkfesubasnlvavsg2i7p64i
« Previous
Showing results 1 — 15 out of 384 results