Lloyd J. W. , Foundations of logic programming, Springer Verlag Symbolic Computation Series, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A-Prolog as a tool for declarative programming - Balduccini, Gelfond, Nogueira (2000) (Correct)
....is short and has mainly an illustrative character. Its natural extensions can, however, be used as a learning tool by students taking classes in digital logic. The syntax and semantics of A Prolog is not new. The syntax expands a traditional notion of a rule from classical logic programming ([16]) by introducing additional logical connectives. The semantics is given by the notion of the answer set of a program [10, 11] Originally, answer set semantics of classical logic programs were designed to give a declarative meaning to the logical connective not, called negation as failure, used ....
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag Symbolic Computation Series, 1987.
Active Behaviour in Deductive Databases - Sadri, Toni (1996) (Correct)
....Constraints 2 Replacement of information can be achieved by combining additions and deletions. 4 Integrity constraints are sentences of first order logic that are properties that the database is required to satisfy as it changes by means of transactions. We assume, without loss of generality [L87] that integrity constraints are formalised as denials of conjunction of literals, i.e. have the form L 1 , L m m 1 where L i are literals. For example, the constraint emp(E, D, S) not dep(D) D2.2 expresses that no one can be employed in a non existent department. It can be argued that ....
J. W. Lloyd, Foundations of logic programming. Springer Verlag Symbolic Computation Series (1987)
Reconciling the Event Calculus with the Situation Calculus - Kowalski, Sadri (1997) (5 citations) Self-citation (Programming) (Correct)
....in the sense that any logical consequence of the iff completion augmented with induction is a property of the program, in that it is true in all intended models of the program characterised by these semantics. 3. 1 Iff completion The construction of the completion of a logic program is well known [3, 13]. Applied to S1 and S2, this construction gives: A1,S1 [ S2= result(A1, S1) happens(A1, S1) initiates(A1, S1, P) v [S2= result(A1, S1) happens(A1, S1) holds(P, S1) terminates(A1, S1, P) together with the Clark equality theory (CET) which consists of the unique name axioms ....
Lloyd J. W. , Foundations of logic programming, Springer Verlag Symbolic Computation Series, 1987.
Reconciling the Event Calculus with the Situation Calculus - Robert Kowalski (1997) (5 citations) Self-citation (Programming) (Correct)
....in the sense that any logical consequence of the iff completion augmented with induction is a property of the program, in that it is true in all intended models of the program characterised by these semantics. 3. 1 Iff completion The construction of the completion of a logic program is well known [3, 13]. Applied to S1 and S2, this construction gives: holds(P, S2) A1,S1 [ S2= result(A1, S1) happens(A1, S1) initiates(A1, S1, P) S2= result(A1, S1) happens(A1, S1) holds(P, S1) terminates(A1, S1, P) SC together with the Clark equality theory (CET) which consists of the unique ....
Lloyd J. W. , Foundations of logic programming, Springer Verlag Symbolic Computation Series, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC