On the public citation graph

A general approach to bottom-up computation of disjunctive semantics

0 signed · 76 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/3-540-52048-1_34openalex-snapshot

A natural semantics for logic programs with negation

inferredcites →https://doi.org/10.1007/3-540-53507-1_88openalex-snapshot

Beginnings of a theory of general database completions

inferredcites →https://doi.org/10.1007/3-540-53557-8_20openalex-snapshot

Negation in logic programming: A formalization in constructive logic

inferredcites →https://doi.org/10.1007/3-540-55015-1_5openalex-snapshot

Semantics of disjunctive logic programs and deductive databases

inferredcites →https://doi.org/10.1007/3-540-57530-8_16openalex-snapshot

Bottom-up query evaluation with partially ordered defaults

inferredcites →https://doi.org/10.1007/3-540-58216-9_42openalex-snapshot

An efficient computation of the extended generalized closed world assumption by support-for-negation sets

inferredcites →https://doi.org/10.1007/3-540-58467-6_8openalex-snapshot

The stable semantics and its variants: A comparison of recent approaches

inferredcites →https://doi.org/10.1007/3-540-58495-1_51openalex-snapshot

Partial evaluation and relevance for approximations of the stable semantics

inferredcites →https://doi.org/10.1007/3-540-58792-6_11openalex-snapshot

Partial deduction of disjunctive logic programs: A declarative approach

inferredcites →https://doi.org/10.1007/3-540-59487-6_7openalex-snapshot

Characterizations of the stable semantics by partial evaluation

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

Negation as Failure

inferredcites →https://doi.org/10.1007/978-3-642-51136-3_12openalex-snapshot

Improved Bottom-Up Query Evaluation in Positive Disjunctive Databases

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

Weak Generalized Closed World Assumption

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

Inferring negative information from disjunctive databases

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

Static semantics for normal and disjunctive logic programs

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

Classical negation in logic programs and disjunctive databases

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

Static semantics as program transformation and well-founded computation

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

Magic computation for well-founded semantics

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

Generalized bottom-up query evaluation

inferredcites →https://doi.org/10.1016/0004-3702(90)90101-5openalex-snapshot

Nonmonotonic reasoning, preferential models and cumulative logics

inferredcites →https://doi.org/10.1016/0304-3975(51)90010-2openalex-snapshot

An efficient strategy for non-Horn deductive databases

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)90024-8openalex-snapshot

Logic programming and negation: A survey

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/c2009-0-22103-9openalex-snapshot

Symbolic Logic and Mechanical Theorem Proving

inferredcites →https://doi.org/10.1109/69.298169openalex-snapshot

Rule ordering in bottom-up fixpoint evaluation of logic programs

inferredcites →https://doi.org/10.1109/69.542027openalex-snapshot

Computation of stable models and its integration with logical query processing

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

The well-founded semantics for general logic programs

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

Backward chaining evaluation in stratified disjunctive theories

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

Positivism vs minimalism in deductive databases

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

Logic programming as constructivism: a formalization and its application to databases

inferredcites →https://doi.org/10.3233/fi-1995-2233openalex-snapshot

A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES

inferredcites →https://doi.org/10.3233/fi-1995-2234openalex-snapshot

A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIES

inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot

Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation

inferredcites →https://doi.org/10.7551/mitpress/4307.003.0006openalex-snapshot

Implementing Stable Semantics by Linear Programming

inferredcites →https://doi.org/10.7551/mitpress/4307.003.0007openalex-snapshot

Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties

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-45628-7_18openalex-snapshot

Disjunctive Logic Programming: A Survey and Assessment

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

Characterizations of the stable semantics by partial evaluation

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/3-540-63255-7_4openalex-snapshot

Improving the alternating fixpoint: The transformation approach

inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_13openalex-snapshot

Magic Sets vs. SLD-Resolution

inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_11openalex-snapshot

Translation of Interactive Datalog Programs for Microcontrollers to Finite State Machines

inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_14openalex-snapshot

A Framework for Goal-Directed Query Evaluation with Negation

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

On computing logic programs

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

Prolegomena to logic programming for non-monotonic reasoning

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

Transformation-based bottom-up computation of the well-founded model

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

Computation of non-ground disjunctive well-founded semantics with constraint logic programming

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

Magic computation for well-founded semantics

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

Logic and databases: A 20 year retrospective

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

Knowledge representation with logic programs

inferred← citeshttps://doi.org/10.1007/s10817-008-9106-5openalex-snapshot

Computing Only Minimal Answers in 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.1016/b978-044450813-3/50021-7openalex-snapshot

Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations

inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00043-0openalex-snapshot

Computation of the semantics of autoepistemic belief theories

inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00044-0openalex-snapshot

A general theory of confluent rewriting systems for logic programming and its applications

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(99)00015-4openalex-snapshot

On cyclic covers and perfect models

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00045-1openalex-snapshot

On the equivalence of the static and disjunctive well-founded semantics and its computation

inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot

Characterizations of the disjunctive stable semantics by partial evaluation

inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10006-1openalex-snapshot

A logical foundation for logic programming II: Semantics of general logic programs

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

A framework to incorporate non-monotonic reasoning into constraint logic programming

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

Transformation-based bottom-up computation of the well-founded model

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

Optimization of bound disjunctive queries with constraints

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/tkde.2003.1185840openalex-snapshot

Binding propagation techniques for the optimization of bound disjunctive queries

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

On the rewriting and efficient computation of bound disjunctive datalog queries

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

Super logic programs

inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot

Logic and Databases Past, Present, and Future

inferred← citeshttps://doi.org/10.3233/fi-1995-2233openalex-snapshot

A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0305007openalex-snapshot

Computing only minimal answers in disjunctive deductive databases

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.