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
A classification of any logic program's failures into different levels of general finite failure is introduced. ... The general failure is then shown to be the limit of those general finite failures, and its interpretation coincides with the complement of the greatest model of the program. ... In this paper, we define derivation sequences for a logic program at the ground level, and we classify the program's failures into different categories of general finite failures. ...doi:10.1016/0743-1066(85)90016-0 fatcat:pxkeecrh7rdbzgs37rcgqq6kny
The paper  purports to present a classification of the general failure sets of logic programs and a simple proof of the theorem on the soundness and completeness of the negation-as-failure rule. ... Our main purpose, however, is to point out major errors, in particular, one in the proof of the above mentioned theorem. ... INTRODUCTION In  , results are claimed to be established about general failure sets, ground general failure sets and negation as failure. ...doi:10.1016/0743-1066(86)90018-x fatcat:cn3xpupzdffhvbi6kppkwicuu4
In this paper, the success and failure of general logic programs are defined mutually recursively. ... General logic programs are programs that have clauses containing inequations and negative literals in their bodies. ... INTRODUCTION This paper studies the negation-as-failure rule for general logic programs, that is, programs that have clauses containing inequations and negative literals in their bodies. ...doi:10.1016/s0743-1066(85)80004-2 fatcat:wiegcrgnqvbatm6qskw4g7ixde
A general logic program is a set of rules that have both positive and negative subgoals. ... We define negation in general logic programs as finite failure, but we limit proof attempts to tight derivations, that is, derivations expressed by trees in which no node has an identical ancestor. ... RULE-BASED NEGATION-AS-FAILURE SEMANTICS In this section we describe informally the semantics of general logic programs with negation as failure interpreted as the "traditional" finite failure [5, 3, ...doi:10.1016/0743-1066(89)90032-0 fatcat:ukw2ajjdhffklasdmyqgghw25u
logic programming. ... Summary: “Local consistency techniques have been introduced in logic programming in order to extend the application domain of logic programming languages. ...
This is obtained by reversing the deduction process, which is usually applied in static-dataflow anal- ysis of logic programs, on generic, possibly abstract, domains for analysis. ... 4343 logic programming without negation as failure (LPwNF). Our results show that the former has a strictly stronger expressive power. ...
99k:68027 applied to combine general logic programs, that is, logic programs possibly containing negative premises. ... We show how the intro- duction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabili- ties of logic programming for non-monotonic reasoning ...
Stépdnek (Prague) 87¢:68069 Van Tu Le [Le Van Tu] 87g:68070 Negation-as-failure rule for general logic programs with equality. J. Logic Programming 2 (1985), no. 4, 285-294. ... The author studies the negation-as-failure rule for general logic programs, i.e., programs that have clauses containing negative lit- erals and inequations in their bodies. ...
Lecture Notes in Computer Science
This results in a formalism which brings the theory of logic programming closer to standard programming practice. ... In a second part we consider extensions to definite clause logic programs. ... Negation as Failure Clark provided a formal framework to study negation as failure  , via the notion of complete logic programs, and proved the soundness of this rule. ...doi:10.1007/3-540-16492-8_78 fatcat:ly6owdbvyrdszkrao3u5hx2w4u
While the negation-as-failure is based on the existence of a finite, failed search tree for the negated goal (in the logic program), the failure of reduction is based on the logical interpretation of nega ... Failure of reduction to head normal form in CRWL is a notion that plays a similar role to that of negation-as-failure in (classical) logic programming, but with a different operational interpretation. ...
Introducing failure extends the class of definable distributions but needs a generalization of the semantics of PRISM programs. ... In this paper,we enhance the modeling power of PRISM by allowing general PRISM programs to fail in the generation process of observable events. ... To perform EM learning of a general PRISM program that may fail, we need a 'failure program' which positively describes how failure occurs in the original program. ...dblp:conf/ijcai/SatoKZ05 fatcat:wfiwddxcfzguzoscvpmogtkcwa
Logic Programming 2 (1985), no. 2, 157-165. Author summary: “A classification of any logic program’s failures into different levels of general finite failure is introduced. ... The general failure is then shown to be the limit of those general finite failures, and its interpretation coincides with the complement of the greatest model of the program. ...
Computing with failures is a typical programming technique in functional logic programs. ... In this case, the programmer is interested in the context of the failed program point in order to analyze the reason of the failure. ... Failures in Encapsulated Search As mentioned at the beginning, computing with failures is a typical programming technique in functional logic programs. ...doi:10.1016/j.entcs.2007.01.002 fatcat:wun4ucznqfbj3eqeoox3gmszii
Thus the notion of completion of a logic program, or complete logic program, was introduced, which consists of a simple transformation of a logic program P. ... Complete logic programs augmented with the domain-closure axiom are proposed as the reference theory for logic programming with negation as failure. ... Appropriate generalizations of the notions of derivation sequence, success set, and finite failure set can also be given for generalized logic programs. ...doi:10.1016/0743-1066(88)90013-1 fatcat:l7w655e4xfcbha7avrt2ltknsy
We discuss the closed world assumption, the completion of a program, the generalized closed world assumption and negation as failure, and give definitions, consistency results and relations among them. ... Summary: “A new fixpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the fixpoint of a disjunctive program obtained ...
« Previous Showing results 1 — 15 out of 402,575 results