Paqui Lucio, et al.  Home/Search
Context Related
| lsi.upc.es/dept/techreps...R9751.ps.gz 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: lsi.upc.es/links/a...reports1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The aim of our work is the definition of compositional semantics for modular units over the class of normal logic programs. In this sense, we propose a declarative semantics for normal logic programs in terms of model classes that is monotonic in the sense that Mod(P [ P 0 ) ` Mod(P ), for any programs P and P', and we show that in the model class associated to every program there is a least model that can be seen as the semantics of the program, which may be built upwards as the least fix... (Update)
Context of citations to this paper: More
.... last year, a model theoretic semantics for normal programs which is monotone with respect to program inclusion has been defined (see [26]) Regarding modularity, one of the approaches for providing logic programming with this kind of feature, is to extend Horn logic programming...
...languages. Actually, another source of inspiration was the definition of compositional semantics for logic programs with negation [LOP 99] This was considered a difficult task due to the non monotonic nature of negation as failure. In that paper, we avoided that problem by...
Cited by: More
Constructive Negation Without Subsidiary Trees - Pasarella, Pino, Orejas (Correct)
Tight and Loose Semantics for Transformation Systems - Orejas, Ehrig (Correct)
Modularity in Logic Programming - Pasarella (Correct)
Similar documents (at the sentence level):
27.1%: An Algebraic Framework For The Definition Of Compositional.. - Lucio, Orejas, Pino (1994) (Correct)
10.8%: A Monotonic Declarative Semantics for Normal Logic Programs - Lucio, Orejas, Pino (Correct)
Active bibliography (related documents): More All
0.5: Semantic Definitions for Normal Open Programs - Orejas, Pino (1999) (Correct)
0.3: Composing Complete and Partial Knowledge - Verbaeten, Bossi (1998) (Correct)
0.3: A Semantics for Modular General Logic Programs - Etalle (1998) (Correct)
Similar documents based on text: More All
0.4: Heterogeneous Modular Systems - Orejas, Pino (2002) (Correct)
0.3: A Generic Component Framework for System Modeling - Ehrig, Orejas, Braatz.. (2002) (Correct)
0.2: On Compositional Semantics - Zadrozny (1992) (Correct)
Related documents from co-citation: More All
3: Constructive negation by pruning - Fages - 1997
3: An approach to constructive negation (context) - Drabent, failure - 1995
3: Negation in logic programming (context) - Kunen - 1987
BibTeX entry: (Update)
P. Lucio, F. Orejas, and E. Pino. An algebraic framework for the definition of compositional semantics of normal logic programs. Journal of Logic Programming, 40:89--123, 1999. http://citeseer.ist.psu.edu/lucio99algebraic.html More
@article{ lucio99algebraic,
author = "Paqui Lucio and Fernando Orejas and Elvira Pino",
title = "An Algebraic Framework for the Definition of Compositional Semantics of Normal Logic Programs",
journal = "Journal of Logic Programming",
volume = "40",
number = "1",
pages = "89-124",
year = "1999",
url = "citeseer.ist.psu.edu/lucio99algebraic.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
759 Negation as failure (context) - Clark - 1978
435 Towards a theory of declarative Knowledge (context) - Apt, Blair et al. - 1988
343 Introduction to Metamathematics (context) - Kleene - 1952
234 Institution: Abstract model theory for specification and pro.. (context) - Goguen, Burstall - 1992
232 Category Theory for Computing Science (context) - Barr, Wells - 1990
224 Algebraic Specification (context) - Wirsing - 1990
192 Logic Programming (context) - Apt - 1990
186 Negation in Logic Programming (context) - Kunen - 1987
180 Logic Programming and Negation: A Survey - Apt, Bol - 1994
174 A Kripke-Kleene Semantics for Logic Programs (context) - Fitting - 1985
161 Fundamentals of Algebraic Specification (context) - Ehrig, Mahr - 1985
149 A Logical Analysis of Modules in Logic Programming (context) - Miller - 1989
80 Introducing institutions (context) - Goguen, Burstall - 1984
68 Negation in Logic Programming (context) - Shepherdson - 1988
67 Negation as failure using tight derivations for general logi.. (context) - van Gelder - 1988
57 A logic programming view of CLP - Maher - 1993
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
42 Fully abstract compositional semantics for logic programs (context) - Gaifman, Shapiro - 1989
39 the equivalence of semantics for normal logic programs - You, Yuan - 1995
36 Contributions to the Semantics of Open Logics Programs (context) - Bossi, Gabrielli et al. - 1992
35 a specification language (context) - Burstall, Goguen - 1980
34 An approach to constructive negation (context) - Drabent - 1995
34 Information and Computation (context) - Stuckey - 1995
28 Intuitionistic Logic (context) - van Dalen - 1986
28 Constructive negation by pruning - Fages - 1997
24 A Three-Valued Semantics for Deductive Database and Logic Pr.. (context) - You, Yuan - 1994
23 SLDNF-Resolution with Equality (context) - Shepherdson - 1992
23 Compositional model-theoretic semantics for logic programs (context) - Brogi, Lamma et al. - 1992
22 Theoretical Computer Science (context) - Fitting - 1986
20 Differential Logic Programming - Bossi, Bugliesi et al. - 1993
16 New concepts for amalgamation and extension in the framework.. (context) - Ehrig, Baldamus et al. - 1993
15 A sound and complete semantics for a version of negation as .. (context) - Shepherdson - 1989
15 A compositional semantics for normal open programs - Etalle, Teusink - 1996
14 Adding Negation-as-Failure to Intuitionistic Logic Programmi.. - Bonner, McCarty - 1990
13 A compositional proof method of partial correctness for norm.. - Ferrand, Lallouet - 1995
13 Compositionality of normal open logic programs - Verbaeten, Denecker et al. - 1997
10 Negation as Failure II (context) - Shepherdson - 1985
10 Compilative Constructive Negation in Constraint Logic Progra.. - Bruscoli, Levi et al. - 1994
9 Programming by combining general logic programs - Brogi, Contiero et al. - 1997
9 On Recent Trends in Algebraic Specifications (context) - Ehrig, Pepper et al. - 1989
2 Institutions for Logic Programmming (context) - Orejas, Pino et al. - 1997
2 Constructive negation based on the completed database (context) - Chang - 1988
Documents on the same site (http://www-lsi.upc.es/links/alcom-it/reports-1997.html): More
Parallel Dictionaries with Local Rules on AVL and Brother Trees - Gabarró, Messeguer (1998) (Correct)
Randomized Binary Search Trees - Martínez, Roura (1997) (Correct)
A Dichotomy Theorem for Learning Quantified Boolean Formulas - Dalmau (1997) (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