K. R. Apt. Logic programming. In Handbook of theoretical computer science (vol. B): formal models and semantics, pages 493--574. MIT Press, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Unknown - (Correct)
....interpretations. De nition 3.6. A program P is complete for a query Q w.r.t. a speci cation specC if specC j= Q implies that Q is an answer for the program, for any instance Q of Q. Notice that an answer Q is an instance of some computed answer for Q. Below we refer to theory ONLY IF(P ) Apt90] that is usually used while de ning Clark completion comp(P ) of a program P . Informally, ONLY IF(P ) is P with implications reversed. For each predicate symbol p, if the clauses of P beginning with p are p( t 1 ) B 1 ; p( t k ) B k then ONLY IF(P ) contains p( x) i=1 9 x ....
K. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, chapter 10, pages 493-574. Elsevier Science Publishers B.V., 1990.
An Overview on Semantical Constraints for Database Models - Thalheim (1996) (1 citation) (Correct)
....model. There are several books and overview papers which could be used for extending this overview on semantics in databases [AHV95, Bis95, Mai83, PDG89, Tha91, Tha92, Tha96, Zal89] on theoretical fundamentals of (deductive) databases [GaM78, GMN81, GMN83, Min88, Thay89] on logical foundations [Apt90, GeN88, Gin88], on type and specification theory [Mit90, Wir90] and on database and knowledge base systems [Cat91, DeA85, ElN89, Fro86, Ker87, KiL89] Kob85, BCN92] The bibliographies in these books contain references to more recent research. The bibliography [Kam81] is a source on research until 1980. For ....
K.R. Apt, Logic programming. In Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Vol. B, Formal Models and Semantics, Elsevier, Amsterdam, 1990, 493 -- 574.
Fluent Logic Programming - Vincenzo Pallotta Theoretical (Correct)
....we obtain the de nition of an extended LP based language that we call Fluent Logic Programming (FLP) which roughly combines the F F syntax with the semantics of EC. In the rest of the paper we assume the reader has familiarity with logic programming and its formal semantics. For an overview see [Apt90]. 1.1 Event Calculus The event calculus (EC) KS86, SK95] is a logic programming based formalism capable of dealing with events occurring within time periods and properties of objects which can persist or change over time. EC is based on the following ontologies or domains: the temporal ....
Krzysztof R. Apt. Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.
Expressive Power and Data Complexity of Nonrecursive - Query Languages For (Correct)
....nonrecursive range restricted Datalog with lists and trees. 3. 3 Prolog Prolog with lists and trees is obtained from the standard by adding sorts, constants [ and , and the functions [ the list constructor) and (the tree constructor) For the standard semantics of Prolog see e.g. [4]. Though there are several approaches to semantics of recursive Prolog, in the case of nonrecursive de nitions all of them collapse to the so called strati ed semantics. The semantics of nonrecursive Prolog can also be found in [34] in nonrecursive Prolog with lists and trees respectively as ....
K. Apt. Logic programming. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 10, pages 493-574. Elsevier Science, Amsterdam, 1990.
The Modal Query Language MDatalog - Nguyen (2001) (Correct)
....first order logic. It is known that with such a restriction, for the case when the signature does not contain function symbols, the least Herbrand model for a program (or a database) is computable in polynomial time and its size is bounded by a polynomial. For surveys of the fields see the works [1, 2, 8]. In the classical propositional and first order logics we are not able, or hardly able, to reason about necessity, belief, knowledge, etc. In order to deal with such modalities it is natural to use modal logics. Address for corresponding: Institute of Informatics, University of Warsaw, ul. ....
Apt, K.: Logic Programming, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (J. van Leeuwen, Ed.), Elsevier, 1990.
An Entailment for Reasoning on the Web - Bry, Schaffert (2003) (1 citation) (Correct)
....Cj is true, but also in interpretations in which some Cj is true. Among such (paraconsistent) interpretations are inconsistent interpretations satisfying Cj but not satisfying Cj. Such interpretations gives room for interpreting so called cycles of recursion through negation with an odd length [11] in a quite natural manner. e.g. the clause p p has a single minimal (inconsistent) paraconsistent model: p . Major advantages of the treatment of negation proposed above is that it extends the Stable Model Semantics [12] and gives it a minimal model setting : Proposition 2. Let P be a ....
....Such Prolog extensions and or adaptions are inspiring for query languages for XML [1] and semistructured data. The approach to nonmonotonic reasoning described in the present paper is reminiscent of a widespread, ofien empirical approach consisting in duplicating every predicate p (cf. e.g. [11,23,24]) 25] describes in more detail this approach in the fi ame work of classical logic. Proposition 3 is an adaptation to the nonstandard models of Definition 4 of a result given in [26] for classical logic. 9 Conclusion This article has first given requirement for logics for reasoning on the Web ....
Apt, K.R., Bol, R.: Logic Programming and Negation: A Survey. J. Logic Pro- gramming 9 (1994)
On Behavior of Interacting Agents - Dekhtyar, Dikovsky, Valiev (2002) (Correct)
....program is also called positive. We suppose that the clauses are safe in the sense that all variables in the head H occur positively in the body L 1 ; Ln ; and that the program a = P a [ fp j p 2 I a g [ fReceived(Agent source; Message) j (Agent source; Message) 2 MsgBox a g is stratified [2]. Program semantics determines the set of actions which in principle can be executed by the agent in its current local state. As it is well known (see [2] stratified logic programs have a unique minimal model M a computed by a standard polynomial time fixpoint computation procedure from the ....
....Ln ; and that the program a = P a [ fp j p 2 I a g [ fReceived(Agent source; Message) j (Agent source; Message) 2 MsgBox a g is stratified [2] Program semantics determines the set of actions which in principle can be executed by the agent in its current local state. As it is well known (see [2]) stratified logic programs have a unique minimal model M a computed by a standard polynomial time fixpoint computation procedure from the groundization gr(P a ) of the program . The semantics Sem(P a ) I a ; MsgBox a ) of P a with respect to a local state (I a ; MsgBox a ) is defined as ....
Apt, K. R., Logic Programming. In: J. van Leeuwen (Ed.) Handbook of Theoretical Computer Science. Volume B. Formal Models and Semantics, Chapter 10, Elsevier Science Publishers B.V. 1990, 493-574.
Bottom-up Transformation for Programs with Procedural Control - Vanhoof, Bruynooghe (Correct)
....when the average length of the paths that are to be found is substantial, bottom up propagation can substantially reduce the search required to solve a query. Bottom up partial deduction and bottom up transformations in general can introduce a correctness problem. Being based on the TP operator [1, 17], these transformations are usually correct with respect to the program s declarative semantics the transformation preserves the success set of the program. This is sucient for a number of applications, but may not be sucient for others. Despite the fact that in the context of the s semantics ....
....query of interest a straightforward operation when compared with performing a full query dependent partial deduction for each query of interest. 2 Preliminaries In what follows, we assume the reader to be familiar with the basic logic programming concepts as they are found, for example, in [1, 17]. In this work, we restrict ourselves to de nite programs, and assume the Prolog variant of logic programming. In particular, we consider a program to be de ned as a sequence of program clauses, where each program clause is labelled by a natural number identifying its position in the program. We ....
[Article contains additional citation context not shown here]
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, pages 493-574. Elsevier Science Publishers B.V., 1990.
A Theory of First-Order Built-in's of Prolog - Apt, Marchiori, Palamidessi (1992) (1 citation) Self-citation (Apt) (Correct)
No context found.
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493--574. Elsevier, 1990. Vol. B.
Polynomial Interpretations as a Basis - For Termination Analysis (Correct)
No context found.
K. R. Apt. Logic programming. In Handbook of theoretical computer science (vol. B): formal models and semantics, pages 493--574. MIT Press, 1990.
Polynomial Interpretations as a Basis - For Termination Analysis (Correct)
No context found.
K. R. Apt. Logic programming. In Handbook of theoretical computer science (vol. B): formal models and semantics, pages 493--574. MIT Press, 1990.
On the Semantics of Logic Program Composition - Antonio Brogi Department (Correct)
No context found.
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493--574. Elsevier, 1990. Vol. B.
Logic Programs as Term Rewriting Systems - Massimo Marchiori Department (1994) (10 citations) (Correct)
No context found.
K.R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 10, pp. 495--574. Elsevier -- MIT Press, 1990.
Learning Recursive Theories in the Normal ILP Setting - Malerba (2003) (1 citation) (Correct)
No context found.
Apt, K. R.: Logic programming, in: Handbook of Theoretical Computer Science (J. van Leeuwen, Ed.), vol. B, Elsevier, Amsterdam, 1990, 493--574.
Induction of Recursive Theories in the Normal ILP.. - Esposito, Malerba, Lisi (2000) (Correct)
No context found.
Apt, K.R.: Logic programming. In: van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Vol. B. Elsevier, Amsterdam (1990) 493-574
Multimodal Logic Programming - Nguyen (2003) (Correct)
No context found.
Apt, K.: Logic Programming, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (J. van Leeuwen, Ed.), Elsevier, 1990.
Interactive Access Control for Web Services - Koshutanski, Massacci (2004) (Correct)
No context found.
Apt, K. Logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Elsevier, 1990.
The Use of Renaming in Composing General Programs - Antonio Brogi Simone (1999) (2 citations) (Correct)
No context found.
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493--574. Elsevier, 1990. Vol. B.
Declarative Semantics of Input Consuming Logic Programs - Bossi, Cocco, Etalle, Rossi (Correct)
No context found.
K. R. Apt. Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495--574. Elsevier and The MIT Press, Amsterdam and Cambridge, MA, 1990.
Common Derivations in Locally Determined - Logic Programs Douglas (Correct)
No context found.
K. R. Apt, Logic programming, in: Handbook of Theoretical Computer Science, ed. J. van Leeuven, MIT Press (1990).
A Fixed Point Semantics for Logic Programs Extended.. - Vanhoof.. (Correct)
No context found.
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, pages 493-574. Elsevier Science Publishers B.V., 1990.
Multimodal Logic Programming and Its Applications to Modal.. - Nguyen (2003) (Correct)
No context found.
Apt, K.: Logic Programming, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (J. van Leeuwen, Ed.), Elsevier, 1990.
Swinging Data Types - The dielectic between actions and.. - Padawitz (1998) (Correct)
No context found.
K.R. Apt, Logic Programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 493-574
Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel (Correct)
No context found.
K.R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pp. 493-574. Elsevier, 1990.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
K.R. Apt. Logic programming. In Jan van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, volume B, pages 493--573. Elsevier, 1990.
First 50 documents Next 50
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