On the public citation graph

Inferring negative information from disjunctive databases

0 signed · 111 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-5196-5_8openalex-snapshot

Towards a Logical Reconstruction of Relational Database Theory

inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot

Negation as Failure

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/bf00243002openalex-snapshot

On the declarative and procedural semantics of logic programs

inferredcites →https://doi.org/10.1007/bf00244994openalex-snapshot

Deduction in non-Horn databases

inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot

On indefinite databases and the closed world assumption

inferredcites →https://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot

An algorithm to compute circumscription

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/0743-1066(85)90002-0openalex-snapshot

Horn clause queries and generalizations

inferredcites →https://doi.org/10.1016/0743-1066(85)90013-5openalex-snapshot

A basis for deductive database systems

inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot

A basis for deductive database systems II

inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot

Negation in logic programming

inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot

Negation in Logic Programming

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.1016/s0743-1066(85)80002-9openalex-snapshot

Computing protected circumscription

inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot

An amateur's introduction to recursive query processing strategies

inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot

An amateur's introduction to recursive query processing strategies

inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot

The Semantics of Predicate Logic as a Programming Language

inferredcites →https://doi.org/10.1145/322276.322278openalex-snapshot

Deleting Repeated Goals in the Problem Reduction Format

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/988346.988350openalex-snapshot

On eliminating loops in Prolog

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot

Knowledge Representation with Logic Programs

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-44404-1_1openalex-snapshot

On the Complexity of Theory Curbing

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-50171-1_18openalex-snapshot

On domain independent disjunctive databases

inferred← citeshttps://doi.org/10.1007/3-540-50701-9_29openalex-snapshot

Benchmark problems for formal nonmonotonic reasoning

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-55015-1_5openalex-snapshot

Semantics of disjunctive logic programs and deductive databases

inferred← citeshttps://doi.org/10.1007/3-540-56039-4_45openalex-snapshot

Minimizing indefinite information in 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-58216-9_41openalex-snapshot

A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs

inferred← citeshttps://doi.org/10.1007/3-540-58235-5_37openalex-snapshot

Algebraic computation of the weak well-founded model for general deductive databases

inferred← citeshttps://doi.org/10.1007/3-540-59487-6_26openalex-snapshot

Stable classes and operator pairs for disjunctive programs

inferred← citeshttps://doi.org/10.1007/3-540-60428-6_4openalex-snapshot

Belief revision in non-monotonic reasoning

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-61630-6_19openalex-snapshot

Characterizing D-WFS: Confluence and iterated GCWA

inferred← citeshttps://doi.org/10.1007/3-540-63255-7_25openalex-snapshot

DisLoP: Towards a disjunctive logic programming system

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-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-540-39615-4_7openalex-snapshot

Model and Fixpoint Semantics for Fuzzy Disjunctive Programs with Weak Similarity

inferred← citeshttps://doi.org/10.1007/978-3-540-68123-6_40openalex-snapshot

Degrees of Exclusivity in Disjunctive Databases

inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_12openalex-snapshot

Improved Bottom-Up Query Evaluation in Positive Disjunctive Databases

inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_9openalex-snapshot

From above and from below: Approximating stable models

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/bf00248321openalex-snapshot

Weak Generalized Closed World Assumption

inferred← citeshttps://doi.org/10.1007/bf00712386openalex-snapshot

Bottom-up computation of the Fitting model for general deductive 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/bf00881915openalex-snapshot

An alternative approach to the semantics of disjunctive logic programs and 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/bf01530824openalex-snapshot

DWAM ? A WAM model extension for disjunctive logic programming

inferred← citeshttps://doi.org/10.1007/bf01530826openalex-snapshot

Static semantics for normal and disjunctive logic programs

inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot

On the computational cost of disjunctive logic programming: Propositional case

inferred← citeshttps://doi.org/10.1007/bfb0013613openalex-snapshot

The near-Horn approach to disjunctive logic programming

inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot

Prolegomena to logic programming for non-monotonic reasoning

inferred← citeshttps://doi.org/10.1007/bfb0026833openalex-snapshot

Goal-directed query processing in disjunctive logic databases

inferred← citeshttps://doi.org/10.1007/bfb0030386openalex-snapshot

A tutorial on Nonmonotonic Reasoning

inferred← citeshttps://doi.org/10.1007/bfb0030663openalex-snapshot

A general approach to bottom-up computation of disjunctive semantics

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.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(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(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(90)90033-2openalex-snapshot

A fixpoint semantics for disjunctive logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(92)90019-yopenalex-snapshot

A procedural semantics for well-founded negation in logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90028-fopenalex-snapshot

An overview of nonmonotonic reasoning and logic programming

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(93)90030-kopenalex-snapshot

Commonsense axiomatizations for logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot

Logic programming and negation: A survey

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-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.50004-xopenalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1016/j.compstruc.2006.08.088openalex-snapshot

A Jacobi–Davidson method for nonlinear and nonsymmetric eigenproblems

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.054openalex-snapshot

Reasoning under minimal upper bounds in propositional logic

inferred← citeshttps://doi.org/10.1016/j.websem.2022.100721openalex-snapshot

Satisfiability and containment of recursive SHACL

inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot

Autoepistemic logic of knowledge and beliefs

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/s0304-3975(96)00129-6openalex-snapshot

Query evaluation in probabilistic relational databases

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10030-4openalex-snapshot

Semantics of (disjunctive) logic programs based on partial evaluation

inferred← citeshttps://doi.org/10.1017/s0269888900005129openalex-snapshot

Deductive database theories

inferred← citeshttps://doi.org/10.1017/s1471068403001704openalex-snapshot

Minimal founded semantics for disjunctive logic programs and deductive databases

inferred← citeshttps://doi.org/10.1023/a:1005952908693openalex-snapshot

Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA

inferred← citeshttps://doi.org/10.1109/69.219736openalex-snapshot

A possible world semantics for disjunctive 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.1142/9789814503730_0040openalex-snapshot

ON EXCLUSIVE DISJUNCTIONS IN DEDUCTIVE DATABASE

inferred← citeshttps://doi.org/10.1145/116825.116838openalex-snapshot

The well-founded semantics for general logic programs

inferred← citeshttps://doi.org/10.1145/153850.153864openalex-snapshot

Complexity aspects of various semantics for disjunctive databases

inferred← citeshttps://doi.org/10.1145/330560.330567openalex-snapshot

Succinct model semantics

inferred← citeshttps://doi.org/10.1145/73721.73724openalex-snapshot

A procedural semantics for well founded negation in logic programs

inferred← citeshttps://doi.org/10.1515/9783110876802.233openalex-snapshot

Belnap’s Epistemic States and Negation-as-Failure

inferred← citeshttps://doi.org/10.1527/tjsai.24.405openalex-snapshot

Verification of Legal Knowledge-base with Conflictive Concept

inferred← citeshttps://doi.org/10.15625/1813-9663/18/1/2415openalex-snapshot

Some approaches that define semantics of deductive database.

inferred← citeshttps://doi.org/10.31274/rtd-180813-9747openalex-snapshot

Generalized knowledge-based semantics for multi-valued logic programs

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.3233/fi-1997-32205openalex-snapshot

Combining Closed World Assumptions with Stable Negation

inferred← citeshttps://doi.org/10.3233/ia-2011-0007openalex-snapshot

Evolving reactive logic programs

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.