On the public citation graph

The expressive power of partial models for disjunctive deductive databases

https://doi.org/10.1007/bfb0031745
0 signed · 44 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.1997.1446openalex-snapshot
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
inferredcites →https://doi.org/10.1007/3-540-54919-6openalex-snapshot
The Problem of Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1007/3-540-60178-3_94openalex-snapshot
A restricted second order logic for finite structures
inferredcites →https://doi.org/10.1007/978-3-642-83952-8openalex-snapshot
Logic Programming and Databases
inferredcites →https://doi.org/10.1007/bf01530761openalex-snapshot
Propositional semantics for disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf01536398openalex-snapshot
Complexity and undecidability results for logic programming
inferredcites →https://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
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/bfb0034711openalex-snapshot
Partial semantics for disjunctive deductive databases
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0304-3975(51)90007-2openalex-snapshot
On the representation and querying of sets of possible worlds
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
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/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified logic programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50101-9openalex-snapshot
Reasoning with minimal models: Efficient algorithms and applications
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/s0304-3975(97)00129-1openalex-snapshot
Expressive power and complexity of partial models for disjunctive deductive databases
inferredcites →https://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferredcites →https://doi.org/10.1093/logcom/7.5.555openalex-snapshot
Deterministic and non-deterministic stable models
inferredcites →https://doi.org/10.1145/182591.182639openalex-snapshot
Adding disjunction to datalog (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
inferredcites →https://doi.org/10.1145/298514.298575openalex-snapshot
Non-deterministic languages to express deterministic transformations
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
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.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_16openalex-snapshot
Minimal Founded Semantics for Disjunctive Logic Programming
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/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0054790openalex-snapshot
Partial evidential stable models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0054791openalex-snapshot
Disjunctive logic programming and autoepistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0055020openalex-snapshot
Disjunctive logic programming and possible model semantics
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00060-xopenalex-snapshot
Reasoning with minimal models: efficient algorithms and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00108-4openalex-snapshot
Circumscribing datalog: Expressive power and complexity
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00027-7openalex-snapshot
Expressiveness of stable model semantics for disjunctive logic programs with functions
inferred← citeshttps://doi.org/10.1023/a:1018903705269openalex-snapshot
``Possible is certain'' is desirable and can be expressive
inferred← citeshttps://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/261124.261126openalex-snapshot
Disjunctive datalog
inferred← citeshttps://doi.org/10.1145/263661.263685openalex-snapshot
Referential actions as logical rules
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/582410.582411openalex-snapshot
Understanding the global semantics of referential actions using logic rules
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.