K.R. Apt, M. Gabbrielli  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/A...CSR9417.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cwi.nl/cwi/publications...CS1994 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semantics allows us to model computed answer substitutions, which is not the case for the other two. We ... (Update)
Context of citations to this paper: More
.... logic program on L: then C(P ) fl I V1 (M I V1 (P ) Proof immediately follows from the well know result of Maher [20] see also Apt [1] for a simpler proof) 2 Proposition 3.5 says that D should be a countable set. However, sometimes it is enough to have only one constant in...
.... sublist( 3, 3, 3] Ss) sublist( 4, 4, 4] Ss) sublist( 5, 5, 5] Ss) sublist([6, 6, 6], Ss) sublist( 7, 7, 7] Ss) sublist( 8, 8, 8] Ss) sublist( 9,...
Cited by: More
Complementing Logic Program Semantics - Roberto Giacobazzi Francesco (1996) (Correct)
Constrained Dependencies - Maher (1995) (Correct)
Termination is Language-independent - Pedreschi, Ruggieri (1994) (Correct)
Similar documents (at the sentence level):
64.0%: A Closer Look at Declarative Interpretations - Apt (1994) (Correct)
Active bibliography (related documents): More All
0.1: Efficient Detection of Incompleteness Errors in the.. - Comini, Levi, Vitiello (1995) (Correct)
0.1: Nondeterminism and Infinite Computations in Constraint - Programming Frank De (1995) (Correct)
0.1: Observable Semantics for Constraint Logic Programs - Gabbrielli, Dore, Levi (1995) (Correct)
Similar documents based on text: More All
0.4: Towards a Logical Semantics for Pure Prolog - Barbuti, De Francesco.. (1998) (Correct)
0.1: Modular Termination Proofs for Logic and Pure Prolog Programs - Apt, Pedreschi (1993) (Correct)
0.1: A New Definition of SLDNF-resolution - Apt (1992) (Correct)
Related documents from co-citation: More All
7: Foundations of Logic Programming (context) - Lloyd - 1987
5: Bottomup Abstract Interpretation of Logic Programs (context) - Codish, Dams et al. - 1990
5: Predicate logic as computational formalism (context) - Clark - 1979
BibTeX entry: (Update)
K. R. Apt and M. Gabbrielli. Declarative interpretations reconsidered. In P. van Hentenryck, editor, Proc. of the Eleventh Int'l Conf. on Logic Programming, pages 74--89. MIT Press, 1994. http://citeseer.ist.psu.edu/apt94declarative.html More
@inproceedings{ krzysztofdeclarative,
author = "Apt, Krzysztof R. and Gabrielli, Maurizio",
title = "Declarative Interpretations Reconsidered",
booktitle = "Logic Programming - Proceedings of the Eleventh International Conference on Logic Programming",
pages = "74-89",
url = "citeseer.ist.psu.edu/apt94declarative.html" }
Citations (may not include all citations):981 Principles of Database and Knowledge-base Systems (context) - Ullman - 1988
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
162 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
128 Declarative Modeling of the Operational Behavior of Logic La.. (context) - Falaschi, Levi et al. - 1989
116 Reasoning about Termination of Pure Prolog Programs - Apt, Pedreschi - 1993
78 Predicate logic as a computational formalism (context) - Clark - 1979
68 A Model-Theoretic Reconstruction of the Operational Semantic.. (context) - Falaschi, Levi et al. - 1993
61 Equivalences of Logic Programs (context) - Maher - 1988
48 the unification free Prolog programs - Apt, Etalle - 1993
31 Declarative programming in Prolog - Apt - 1993
15 a Vu in Fixpoints of Logic Programs (context) - Maher, Ramakrishnan - 1989
12 A direct proof for the completeness of SLD-resolution (context) - Stark - 1990
9 Unsolvable problems for SLDNF resolution (context) - Shepherdson - 1991
7 Dipartimento di Informatica (context) - Bossi, Gabbrielli et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://ftp.cwi.nl/cwi/publications/reports/CS-1994.html): More
A Logic for Variable Aliasing in Logic Programs - Marchiori (1994) (Correct)
Uniform Deterministic Self-Stabilizing Ring-Orientation on.. - Hoepman (1994) (Correct)
Proof-Checking a Data Link Protocol - Helmink, Sellink, Vaandrager (1994) (Correct)
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