On the public citation graph
Deduction in non-Horn databases
0 signed · 139 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/978-1-4684-3384-5_4openalex-snapshot
Logic for Data Description
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1145/2422.2423openalex-snapshot
On compiling queries in recursive first-order databases
inferredcites →https://doi.org/10.1145/320083.320088openalex-snapshot
On semantic issues connected with incomplete information databases
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/322186.322189openalex-snapshot
Equality and Domain Closure in First-Order Databases
inferredcites →https://doi.org/10.1145/582095.582123openalex-snapshot
Null values in data base management a denotational semantics approach
inferredcites →https://doi.org/10.1201/9781420003345.ch1openalex-snapshot
Introduction to Database Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.4550040402openalex-snapshot
Answering atomic queries in indefinite deductive databases
inferred← citeshttps://doi.org/10.1002/int.4550050507openalex-snapshot
On the relationship between CWA, minimal model, and minimal herbrand model semantics
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_45openalex-snapshot
Some extensions to the closed world assumption in databases
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_17openalex-snapshot
Procedural Semantics for Fuzzy Disjunctive Programs
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-49545-2_3openalex-snapshot
Disjunctive Logic Program = Horn Program + Control Program
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_47openalex-snapshot
Model theory of deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-51251-9_6openalex-snapshot
Specifying closed world assumptions for logic databases
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_55openalex-snapshot
The semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_88openalex-snapshot
Beginnings of a theory of general database completions
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_219openalex-snapshot
A proof-theoretic framework for nonmonotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_220openalex-snapshot
On semantics, syntactics and fixpoints of general programs
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_31openalex-snapshot
Semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_1openalex-snapshot
On extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_5openalex-snapshot
Expressive power and complexity of disjunctive datalog under the stable model semantics
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_74openalex-snapshot
On compact representations of propositional circumscription
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_18openalex-snapshot
An abductive framework for negation in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_24openalex-snapshot
Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_20openalex-snapshot
Logics for Negation as Failure
inferred← citeshttps://doi.org/10.1007/978-1-4612-4980-1_15openalex-snapshot
Negation in Knowledge Base Management Systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4980-1_21openalex-snapshot
A Brief Survey of Logic and Database Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_10openalex-snapshot
Logical Approaches to Incomplete Information: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-6245-0_15openalex-snapshot
A Bibliography on Uncertainty Management in Information Systems
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-030-60067-9_6openalex-snapshot
An Introduction to Answer Set Programming and Some of Its Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-39615-4_7openalex-snapshot
Model and Fixpoint Semantics for Fuzzy Disjunctive Programs with Weak Similarity
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_18openalex-snapshot
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_24openalex-snapshot
Predicate Completion for non-Horn Clause Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/978-3-7908-1846-8_18openalex-snapshot
Sound and Complete Propositional Nonmonotonic Logic of Hierarchically-Minimal Models
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_3openalex-snapshot
Consequence Finding Algorithms
inferred← citeshttps://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferred← citeshttps://doi.org/10.1007/bf00881796openalex-snapshot
Interpreting disjunctive logic programs based on a strong sense of disjunction
inferred← citeshttps://doi.org/10.1007/bf00881837openalex-snapshot
First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment
inferred← citeshttps://doi.org/10.1007/bf00881914openalex-snapshot
Ordered model trees: A normal form for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530762openalex-snapshot
Logic programming and reasoning with incomplete information
inferred← citeshttps://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferred← citeshttps://doi.org/10.1007/bf02916880openalex-snapshot
Argumentation in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf02943187openalex-snapshot
The least fixpoint transformation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf03037516openalex-snapshot
Closed world assumptions having precedence in predicates
inferred← citeshttps://doi.org/10.1007/bfb0012838openalex-snapshot
Recursive query answering with non-horn clauses
inferred← citeshttps://doi.org/10.1007/bfb0012839openalex-snapshot
Case inference in resolution-based languages
inferred← citeshttps://doi.org/10.1007/bfb0026833openalex-snapshot
Goal-directed query processing in disjunctive logic databases
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0032425openalex-snapshot
Generalized bottom-up query evaluation
inferred← citeshttps://doi.org/10.1007/bfb0054794openalex-snapshot
Abduction, argumentation and bi-disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot
An algorithm to compute circumscription
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90018-sopenalex-snapshot
On the complexity of propositional knowledge base revision, updates, and counterfactuals
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90051-xopenalex-snapshot
An efficient method for eliminating varying predicates from a circumscription
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90018-7openalex-snapshot
Parsing as non-Horn deduction
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90012-mopenalex-snapshot
Generalized Closed World Assumption is II02-Complete
inferred← citeshttps://doi.org/10.1016/0169-023x(87)90022-xopenalex-snapshot
Coping with indefinite and negative data in deductive databases: A survey
inferred← citeshttps://doi.org/10.1016/0169-023x(91)90038-yopenalex-snapshot
Handling indefinite and negative data in a deductive database
inferred← citeshttps://doi.org/10.1016/0169-023x(94)90030-2openalex-snapshot
The indefinite closed world assumption
inferred← citeshttps://doi.org/10.1016/0169-023x(96)00037-7openalex-snapshot
On computing minimal and perfect model membership
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90006-nopenalex-snapshot
Semantics of Horn and disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90214-zopenalex-snapshot
Paraconsistent disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90073-3openalex-snapshot
Propositional circumscription and extended closed-world reasoning are ΠP2-complete
inferred← citeshttps://doi.org/10.1016/0743-1066(88)90006-4openalex-snapshot
Perspectives in deductive databases
inferred← citeshttps://doi.org/10.1016/0743-1066(90)90033-2openalex-snapshot
A fixpoint semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00026-3openalex-snapshot
Negation and minimality in disjunctive databases
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00106-gopenalex-snapshot
Bottom-up computation of perfect models for disjunctive theories
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/b978-0-444-88433-6.50028-9openalex-snapshot
Possible Model Semantics for Disjunctive Databases
inferred← citeshttps://doi.org/10.1016/b978-0-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50014-2openalex-snapshot
A Logic-based Language for Database Updates
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50015-4openalex-snapshot
Compiling the GCWA in Indefinite Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.artint.2014.07.004openalex-snapshot
Disjunctive closures for knowledge compilation
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00009-4openalex-snapshot
Is intractability of nonmonotonic reasoning a real drawback?
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80004-2openalex-snapshot
The complexity of propositional closed world reasoning and circumscription
inferred← citeshttps://doi.org/10.1016/s0165-0114(96)00168-6openalex-snapshot
Fuzzy information in extended fuzzy relational databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(00)00016-1openalex-snapshot
Minimal model generation for refined answering of generalized queries in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00026-8openalex-snapshot
Top-down query processing in indefinite stratified 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(96)00182-xopenalex-snapshot
On compact representations of propositional circumscription
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00004-2openalex-snapshot
Argumentation-based abduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(85)80002-9openalex-snapshot
Computing protected circumscription
inferred← citeshttps://doi.org/10.1017/s0269888900005129openalex-snapshot
Deductive database theories
inferred← citeshttps://doi.org/10.1017/s1471068404002273openalex-snapshot
Optimization of bound disjunctive queries with constraints
inferred← citeshttps://doi.org/10.1023/a:1005723423016openalex-snapshot
Evaluation of Queries under Closed-World Assumption
inferred← citeshttps://doi.org/10.1023/a:1005779507994openalex-snapshot
Deduction Trees and the View Update Problem in Indefinite Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1020109502432openalex-snapshot
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1109/69.219736openalex-snapshot
A possible world semantics for disjunctive databases
inferred← citeshttps://doi.org/10.1109/69.317702openalex-snapshot
An efficient indefiniteness inference scheme in indefinite deductive databases
inferred← citeshttps://doi.org/10.1109/ismvl.1990.122644openalex-snapshot
Paraconsistent disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/lics.1995.523252openalex-snapshot
Uniform proofs and disjunctive logic programming
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185840openalex-snapshot
Binding propagation techniques for the optimization of bound disjunctive queries
inferred← citeshttps://doi.org/10.1145/137097.137886openalex-snapshot
On the complexity of propositional knowledge base revision, updates, and counterfactuals
inferred← citeshttps://doi.org/10.1145/153850.153863openalex-snapshot
Negation and minimality in non-horn databases
inferred← citeshttps://doi.org/10.1145/153850.153864openalex-snapshot
Complexity aspects of various semantics for disjunctive databases
inferred← citeshttps://doi.org/10.1145/170791.170821openalex-snapshot
Towards a relational model for exclusively disjunctive information
inferred← citeshttps://doi.org/10.1145/1804669.1804688openalex-snapshot
Answering non-monotonic queries in relational data exchange
inferred← citeshttps://doi.org/10.1145/182591.182639openalex-snapshot
Adding disjunction to datalog (extended abstract)
inferred← citeshttps://doi.org/10.1145/203052.203074openalex-snapshot
On deductive databases with incomplete information
inferred← citeshttps://doi.org/10.1145/232616.232691openalex-snapshot
Implementing deductive databases by mixed integer programming
inferred← citeshttps://doi.org/10.1145/288627.288694openalex-snapshot
Providing semantics for indefinite deductive databases
inferred← citeshttps://doi.org/10.1145/6012.15408openalex-snapshot
Negation as failure for first-order queries
inferred← citeshttps://doi.org/10.1145/6012.15410openalex-snapshot
The extended closed world assumption and its relationship to parallel circumscription
inferred← citeshttps://doi.org/10.1145/73721.73727openalex-snapshot
A sound and complete query evaluation algorithm for relational databases with disjunctive information
inferred← citeshttps://doi.org/10.11501/3099098openalex-snapshot
Studies on disjunctive logic programming
inferred← citeshttps://doi.org/10.1515/9783111386690-010openalex-snapshot
2218 Nichtmonotones Schließen – Die Kunst des Revidierens
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:9)2011openalex-snapshot
Answering Non-Monotonic Queries in Relational Data Exchange
inferred← citeshttps://doi.org/10.2200/s00435ed1v01y201207dtm029openalex-snapshot
Incomplete Data and Data Dependencies in Relational Databases
inferred← citeshttps://doi.org/10.26348/znwwsi.6.74openalex-snapshot
Notes on Nonmonotonic Autoepistemic Propositional Logic
inferred← citeshttps://doi.org/10.2991/icaae-18.2019.36openalex-snapshot
An Axiological Study of Tumpal Batik Motif and Its Relevance to the Character Education
inferred← citeshttps://doi.org/10.31274/rtd-180813-13103openalex-snapshot
Disjunctively incomplete information in relational databases: modeling and related issues
inferred← citeshttps://doi.org/10.31274/rtd-180813-8846openalex-snapshot
Indefinite and maybe information in deductive relational databases
inferred← citeshttps://doi.org/10.3233/fi-1994-201236openalex-snapshot
SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
inferred← citeshttps://doi.org/10.3745/kipstd.2002.9d.2.243openalex-snapshot
Inclusive and Exclusive or Interpretation for Indefinite Deductive Databases
inferred← citeshttps://doi.org/10.4230/dfu.vol5.10452.161openalex-snapshot
Semantics for Non-Monotone Queries in Data Exchange and Data Integration
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.