On the public citation graph
Disjunctive deductive databases
0 signed · 75 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52885-7_82openalex-snapshot
Generalized well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/3-540-54563-8_109openalex-snapshot
WF 3: A semantics for negation in normal disjunctive logic programs
inferredcites →https://doi.org/10.1007/978-1-4615-8297-7_11openalex-snapshot
A Formal Approach to Null Values in Database Relations
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00244495openalex-snapshot
Model theoretic approach to view updates in deductive databases
inferredcites →https://doi.org/10.1007/bf00881907openalex-snapshot
View updates in stratified disjunctive databases
inferredcites →https://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferredcites →https://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1007/bfb0012838openalex-snapshot
Recursive query answering with non-horn clauses
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(85)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
inferredcites →https://doi.org/10.1016/0004-3702(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferredcites →https://doi.org/10.1016/0020-0190(77)90013-8openalex-snapshot
Null values in a relational data base
inferredcites →https://doi.org/10.1016/0020-0190(90)90012-mopenalex-snapshot
Generalized Closed World Assumption is II02-Complete
inferredcites →https://doi.org/10.1016/0022-0000(84)90080-1openalex-snapshot
Database relations with null values
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/0743-1066(88)90006-4openalex-snapshot
Perspectives in deductive databases
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/0743-1066(90)90033-2openalex-snapshot
A fixpoint semantics for disjunctive logic programs
inferredcites →https://doi.org/10.1016/0743-1066(94)00106-gopenalex-snapshot
Bottom-up computation of perfect models for disjunctive theories
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50028-9openalex-snapshot
Possible Model Semantics for Disjunctive Databases
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50015-4openalex-snapshot
Compiling the GCWA in Indefinite Deductive Databases
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1109/icde.1990.113503openalex-snapshot
On representing indefinite and maybe information in relational databases: a generalization
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/319996.320014openalex-snapshot
A foundation of CODD's relational maybe-operations
inferredcites →https://doi.org/10.1145/320107.320109openalex-snapshot
Extending the database relational model to capture more meaning
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322234.322239openalex-snapshot
On Databases with Incomplete Information
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/5383.5388openalex-snapshot
A sound and sometimes complete query evaluation algorithm for relational databases with null values
inferredcites →https://doi.org/10.1145/582095.582123openalex-snapshot
Null values in data base management a denotational semantics approach
inferredcites →https://doi.org/10.1145/582121.582123openalex-snapshot
Null values in data base management a denotational semantics approach
inferredcites →https://doi.org/10.1145/6012.15410openalex-snapshot
The extended closed world assumption and its relationship to parallel circumscription
inferredcites →https://doi.org/10.1145/73721.73726openalex-snapshot
Complexity of query processing in databases with OR-objects
inferredcites →https://doi.org/10.1145/73721.73727openalex-snapshot
A sound and complete query evaluation algorithm for relational databases with disjunctive information
inferredcites →https://doi.org/10.1145/77643.77644openalex-snapshot
Indefinite and maybe information in relational databases
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.21236/ada232064openalex-snapshot
Generalized Disjunctive Well-Founded Semantics for Logic Programs
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-48199-0_13openalex-snapshot
Part of Speech Tagging from a Logical Point of View
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_9openalex-snapshot
Integrity Constraints: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-6245-0_3openalex-snapshot
Imperfect knowledge in databases
inferred← citeshttps://doi.org/10.1007/978-3-540-75256-1_18openalex-snapshot
A Logical Approach to Qualitative and Quantitative Reasoning
inferred← citeshttps://doi.org/10.1007/bf00244495openalex-snapshot
Model theoretic approach to view updates in deductive databases
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50123-8openalex-snapshot
On Positive Occurrences of Negation as Failure
inferred← citeshttps://doi.org/10.1016/s0169-023x(96)00043-2openalex-snapshot
Manipulation of exclusive disjunctive data in relational databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(98)00027-5openalex-snapshot
An architecture for a parallel disjunctive deductive database system
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00147-5openalex-snapshot
On the complexity of data disjunctions
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10001-2openalex-snapshot
Negation as failure in the head
inferred← citeshttps://doi.org/10.1023/a:1011271902410openalex-snapshot
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1018939502485openalex-snapshot
Nonmonotonic reasoning: from complexity to algorithms
inferred← citeshttps://doi.org/10.1109/dexa.1997.617382openalex-snapshot
A query-based horizontal fragmentation approach for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/ideas.1997.625663openalex-snapshot
A minimal-model based horizontal fragmentation algorithm for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/ideas.1998.694380openalex-snapshot
A model-forest based horizontal fragmentation approach for disjunctive deductive databases
inferred← citeshttps://doi.org/10.3233/fi-1997-32205openalex-snapshot
Combining Closed World Assumptions with Stable Negation
inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0016openalex-snapshot
Computing Stable Models by Program Transformation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.