(Enter summary)
Abstract: This dissertation examines the semantics of a new paradigm of logic programming called
subset-logic programming. The most novel construct of a subset-logic program is the subset assertion,
which in conjuction with the more conventional relational and equational assertions provide a
declarative alternative to many common uses of Prolog's extra-logical features: cut, assert, retract,
setof, and mode declarations. These three forms effectively allow to specify function and relation
definitions... (Update)
Context of citations to this paper: More
...logical consequence semantics for logic programs with finite sets. This system was used to give a declarative semantics for the language SuRE [Jan94], and can be used for other languages based upon these set constructors. The axiom system SetAx Gamma has essentially been...
.... with terms that are not necessarily syntactically identical, as there are equational theories that the unification must take into account [37, 40]. Furthermore, some applications may need unification to be generalized to solving inequality constraints over some domain....
Cited by: More
Set Constructors, Finite Sets, and Logical Semantics - Jana, Jayaraman
(Correct)
Subset Logic Programs And Their Implementation - Jayaraman, Moon (1994)
(Correct)
Theory of Partial-Order Programming - Osorio, Jayaraman, al. (1995)
(Correct)
Active bibliography (related documents): More All
0.2: Automated Reasoning with Uncertainties - Silva (1992)
(Correct)
0.2: A System for Reasoning with Fuzzy Predicates - Silva, Carbogim (1994)
(Correct)
0.0: The Constructive Foundations of the System eb - Stevenson (1996)
(Correct)
Similar documents based on text: More All
0.0: Discourse Connectives, Inference and Information Structure - Kruijff-Korbayova, Webber (2000)
(Correct)
0.0: Tree Spanners in Planar Graphs - Fekete, Kremer (1998)
(Correct)
0.0: On Biases in Inductive Data Engineering - Kuklova, Popelínsky (1995)
(Correct)
Related documents from co-citation: More All
6: Foundations of Logic Programming (context) - Lloyd - 1987
6: Programming with equations (context) - Jayaraman, Plaisted - 1989
5: A Rule-Based Language with Functions and Sets (context) - Abiteboul, Grumbach - 1991
BibTeX entry: (Update)
D. Jana, Semantics of Subset-Logic Languages, Ph.D. dissertation, Department of Computer Science, SUNY-Buffalo, August 1994. http://citeseer.ist.psu.edu/jana94semantics.html More
@techreport{ jana94semantics,
author = "Devashis Jana",
title = "Semantics of Subset-Logic Languages",
number = "94-37",
month = "11,",
year = "1994",
url = "citeseer.ist.psu.edu/jana94semantics.html" }
Citations (may not include all citations):
312
The Well-Founded Semantics for General Logic Programs
- Van Gelder, Ross et al. - 1991
112
OLD Resolution with Tabulation (context) - Tamaki, Sato - 1986
12
Introduction to Logic (context) - Suppes - 1957
4
Logic Programs with Negation: Classes (context) - Turi - 1989
Documents on the same site (http://www.cs.buffalo.edu/pub/tech-reports/README.html): More
Information Capacity of Binary Weights Associative Memories - Jagota, Narasimhan, Regan (1996)
(Correct)
On Self-Testing without the Generator Bottleneck - Ravikumar, Sivakumar (1995)
(Correct)
The Design of Uncheatable Benchmarks Using Complexity Theory - Cai, Nerurkar, Wu (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