Edward P.F. Chan  Home/Search
Context Related
| emap.uwaterloo.ca/publication/cwa.ps 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: emap.uwaterloo.ca/publica...index (more) Homepages: E.Chan |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the fundamental problem of when a ground atom in a disjunctive database is assumed false. There are basically two different approaches for inferring negative information for disjunctive databases; they are Minker's Generalized Closed World Assumption (GCWA) and Ross and Topor's Disjunctive Database Rule (DDR). A problem with the GCWA is that disjunctive clauses are sometimes interpreted exclusively, even when they are intended for inclusive interpretation. On the other hand, the... (Update)
Context of citations to this paper: More
...section to extended disjunctive programs in general. 3 The possible model semantics is equivalent to the possible world semantics in [6]. 9 3.1 Paraconsistent Stable Models An extended disjunctive program is a finite set of clauses of the form: L 1 . L l L l 1 ....
...models is equal to the set of all minimal models of T . For various variants of circumscription, see [14] As noted by various authors [5, 6, 17 20], reasoning under minimal models runs into problems in connection with disjunctive information. The minimality principle of...
Cited by: More
Curb Your Theory ! - Circumscriptive Approach For (Correct)
Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel (Correct)
Techniques for Treating Uncertain Knowledge-Based Databases - Yang, Lee-Kwang (Correct)
Active bibliography (related documents): More All
0.3: Negation And Minimality In Disjunctive Databases - Schaerf (1995) (Correct)
0.3: Logic Programming and Autoepistemic Logics: New Relations and.. - Schaerf (1992) (Correct)
0.2: On Computing The GCWA - Johnson (1994) (Correct)
Similar documents based on text: More All
0.7: An Extension to GCWA and Query Evaluation for Disjunctive.. - Wang (2001) (Correct)
0.3: August 2, 1993 Revised March 28, 1994 - Ed Mar Ch (Correct)
0.3: Negation in Disjunctive Logic Programs - Sakama, Inoue (1993) (Correct)
Related documents from co-citation: More All
16: Possible model semantics for disjunctive databases - Sakama - 1989
16: The Stable Model Semantics for Logic Programming - Gelfond - 1988
15: On Indefinite Data Bases and the Closed World Assumption (context) - Minker - 1982
BibTeX entry: (Update)
E. Chan. A possible worlds semantics for disjunctive databases. IEEE Transactions on Data and Knowledge Engineering, 1992. To appear. http://citeseer.ist.psu.edu/chan99possible.html More
@article{ chan93possible,
author = "Edward P. F. Chan",
title = "A Possible World Semantics for Disjunctive Databases",
journal = "Knowledge and Data Engineering",
volume = "5",
number = "2",
pages = "282-292",
year = "1993",
url = "citeseer.ist.psu.edu/chan99possible.html" }
Citations (may not include all citations):4212 Computers and Intractability-A Guide to the Theory of NP-Com.. (context) - Garey, Johnson - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1987
981 Principles of Database and Knowledge-base Systems (context) - Ullman - 1988
858 The Stable Model Semantics for Logic Programming - Gelfond, Lifschitz - 1988
773 Reducibility among Combinatorial Problems (context) - Karp - 1972
759 Negation as Failure (context) - Clark - 1978
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
295 On Closed World Data Bases (context) - Reiter - 1978
248 The Semantics of Predicate Logic as a Programming Language (context) - Emdem, van - 1976
185 On Indefinite Databases and the Closed World Assumption (context) - Minker - 1982
132 Towards a Logical Reconstruction of Relational Database Theo.. (context) - Reiter - 1984
118 Unfounded Sets and Well-founded Semantics for General Logic .. (context) - Van Gelder, Ross et al. - 1988
115 The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1989
67 Negation as Failure Using Tight Derivation for General Logic.. (context) - Van Gelder - 1988
54 Inferring Negative Information from Disjunctive Databases (context) - Ross, Topor - 1988
52 the Declarative Semantics of Logic Programs with Negation (context) - Lifschitz - 1988
44 Possible Model Semantics for Disjunctive Databases - Sakama - 1989
44 Deduction in Non-Horn Databases (context) - Yahya, Henschen - 1985
36 The Well Founded Semantics for Disjunctive Logic Programs (context) - Ross - 1989
22 Negation as Failure: A Comparison of Clark's Completed Data .. (context) - Shepherdson - 1984
19 The Extended Closed World Assumption and Its Relationship to.. (context) - Gelfond, Przymusinski et al. - 1986
13 Answering Queries in Indefinite Databases and the Null Value.. (context) - Grant, Minker - 1986
7 the Semantics of Stratified Deductive Databases (context) - Przymusinski - 1988
3 Positivism Versus Minimalism in Deductive Databases (context) - Bidoit, Hull - 1986
1 Generalized Closed World Assumption Is \Pi 2 0 - Complete (context) - Chomicki, Subrahmanian - 1990
1 Compiling the GCWA (context) - Henschen, Park - 1988
1 Plausible World Assumption (context) - Lozinskii - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://emap.uwaterloo.ca/publication/index.html): More
A General and Efficient Implementation of Geometric Operators.. - Chan, Ng (1997) (Correct)
QL/G: A Spatial Database Management System - Chan, Wong, Abbott, Tan (1997) (Correct)
Testing Satisfiability of a Class of Object-Oriented Conjunctive.. - Chan (1999) (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