On the public citation graph

Partial semantics for disjunctive deductive databases

https://doi.org/10.1007/bfb0034711
0 signed · 33 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.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferredcites →https://doi.org/10.1006/jcss.1997.1446openalex-snapshot
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/bf02341854openalex-snapshot
Stable and extension class theory for logic programs and default logics
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/bfb0034711openalex-snapshot
Partial semantics for disjunctive deductive databases
inferredcites →https://doi.org/10.1016/0743-1066(85)90014-7openalex-snapshot
A deterministic prolog fixpoint semantics
inferredcites →https://doi.org/10.1016/0743-1066(92)90015-uopenalex-snapshot
Short note preferred extensions are partial stable models
inferredcites →https://doi.org/10.1016/0743-1066(94)00023-yopenalex-snapshot
On the equivalence of semantics for normal logic programs
inferredcites →https://doi.org/10.1016/s0022-0000(05)80053-4openalex-snapshot
A three-valued semantics for deductive databases and logic programs
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/182591.182639openalex-snapshot
Adding disjunction to datalog (extended abstract)
inferredcites →https://doi.org/10.1145/195613.195646openalex-snapshot
Modular stratification and magic sets for Datalog programs with negation
inferredcites →https://doi.org/10.3233/fi-1990-13103openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs
inferredcites →https://doi.org/10.3233/fi-1991-14307openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs1
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0014openalex-snapshot
Splitting a Logic Program

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-45402-0_10openalex-snapshot
A Comparative Study of Well-Founded Semantics for Disjunctive Logic 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-45744-5_22openalex-snapshot
A Top-Down Procedure for Disjunctive Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/bfb0031745openalex-snapshot
The expressive power of partial models for disjunctive deductive databases
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.1017/s1471068419000139openalex-snapshot
Paracoherent Answer Set Semantics meets Argumentation Frameworks
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9264openalex-snapshot
Explaining Answer Set Programming in Argumentative Terms
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9417openalex-snapshot
Logic Programming in Assumption-Based Argumentation Revisited - Semantics and Graphical Representation
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10679openalex-snapshot
On the Computation of Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11045openalex-snapshot
Minimal Undefinedness for Fuzzy Answer Sets
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11540openalex-snapshot
Externally Supported Models for Efficient Computation of Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.1613/jair.5581openalex-snapshot
On the Equivalence between Assumption-Based Argumentation and Logic Programming
showing the first 12 of 13 · page through all 13
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.