(Enter summary)
Abstract: The aim of this paper is twofold: to characterize contextual logic programs
by means of metric semantics and to argue the usefulness of metric
characterizations for formally reasoning about program properties.
A new denotational semantics of contextual logic programs is proposed.
It is defined compositionally, without any help of any declarative
paradigm and of any transition system. Following the lines of [7], it uses
metric spaces rather than cpo's and processes as semantic domains. It
is... (Update)
Active bibliography (related documents): More All
0.3: A Methodology For Proving Termination Of Logic Programs - Wang, Shyamasundar (1991)
(Correct)
0.2: A Transformational Methodology for Proving Termination of.. - Rao, Kapur, al. (1991)
(Correct)
0.2: Logic Programming and Logic Grammars with Binarization and.. - Tarau, Dahl (1994)
(Correct)
Similar documents based on text: More All
0.1: Cardinality Analysis of Prolog - Braem, Le Charlier, Modart, Van.. (1994)
(Correct)
0.1: A Universal Top-Down Fixpoint Algorithm - Le Charlier, Van Hentenryck (1992)
(Correct)
0.1: A General Framework for Integrating HCLP and PCSP - Jampel, Jacquet, Gilbert (1996)
(Correct)
BibTeX entry: (Update)
@inproceedings{ jacquet92metric,
author = "Jean-Marie Jacquet",
title = "Metric Characterizations of Contextual Logic Programs",
booktitle = "{UK} Conference on Logic Programming",
pages = "21-40",
year = "1992",
url = "citeseer.ist.psu.edu/224730.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
248
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
79
Logic Programming: Systematic Program Development (context) - Deville - 1990
78
Acyclic Programs (context) - Apt, Bezem - 1990
59
Studies in pure Prolog: termination (context) - Apt, Pedreschi - 1990
58
Contextual Logic Programming (context) - Monteiro, Porto - 1989
44
Efficient tests for top-down termination of logical rules (context) - Ullman, van Gelder - 1988
41
Proving Termination of General Prolog Programs (context) - Apt, Pedreschi - 1991
41
Characterizing Termination of Logic Programs with Level Mapp.. (context) - Bezem - 1989
38
Information and Control (context) - de Bakker, Zucker et al. - 1982
26
Introduction to Logic Programming (context) - Hogger - 1984
24
Heldermann Verlag (context) - Engelking - 1989
19
Proving Termination Properties of Prolog Programs: a Semanti.. (context) - Baudinet - 1988
17
volume 446 of Lecture Notes in Artificial Intelligence (context) - Plumer, for - 1990
17
Characterization of Terminating Logic Programs (context) - Vasak, Potter - 1986
8
Rewriting Concepts in the Study of Termination of Logic Prog.. (context) - Shyamasundar, Rao et al.
5
Comparative Semantics for a Parallel Contextual Logic Progra.. (context) - Jacquet, Monteiro - 1990
1
Semantics and Proof Theory of First-Order Built-in's of Prol.. (context) - Palamidessi, Marchiori et al. - 1992
Documents on the same site (http://www.info.fundp.ac.be/~jmj/Research/Publications/conferences.html): More
Modeling Coordination via Asynchronous Communication - Antonio Brogi And (1997)
(Correct)
Communicating Clauses: towards Synchronous Communication in.. - Jacquet, Monteiro (1992)
(Correct)
Towards Resource Handling in Logic Programming: the PPL.. - Jacquet, Monteiro (1996)
(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