On the public citation graph

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

https://doi.org/10.1007/bfb0023807
0 signed · 54 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-53557-8_20openalex-snapshot
Negation in logic programming: A formalization in constructive logic
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/3-540-61630-6_19openalex-snapshot
Characterizing D-WFS: Confluence and iterated GCWA
inferredcites →https://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferredcites →https://doi.org/10.1007/bfb0030665openalex-snapshot
Magic computation for well-founded semantics
inferredcites →https://doi.org/10.1016/0022-0000(93)90024-qopenalex-snapshot
The alternating fixpoint of logic programs with negation
inferredcites →https://doi.org/10.1016/0304-3975(94)00153-aopenalex-snapshot
Bottom-up evaluation and query optimization of well-founded models
inferredcites →https://doi.org/10.1016/0743-1066(93)90021-8openalex-snapshot
Unfold⧸fold transformation of general logic programs for the well-founded semantics
inferredcites →https://doi.org/10.1016/0743-1066(94)00028-5openalex-snapshot
Efficient top-down computation of queries under the well-founded semantics
inferredcites →https://doi.org/10.1016/0743-1066(94)00104-eopenalex-snapshot
On the correctness of unfold/fold transformation of normal and extended logic programs
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/153850.153861openalex-snapshot
An alternating fixpoint tailored to magic programs
inferredcites →https://doi.org/10.1145/153850.153865openalex-snapshot
Query evaluation under the well-founded semantics
inferredcites →https://doi.org/10.1145/191839.191927openalex-snapshot
XSB as an efficient deductive database engine
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.1145/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
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.14236/ewic/adbis1996.4openalex-snapshot
SLDMagic—An Improved Magic Set Technique
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/4298.003.0030openalex-snapshot
Relating Stable Models and AI Planning Domains
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0033openalex-snapshot
Experimenting with Nonmonotonic Reasoning
inferredcites →https://doi.org/10.7551/mitpress/4299.003.0047openalex-snapshot
Differential Bottom-Up Computation of the Well-Founded Semantics
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0006openalex-snapshot
Implementing Stable Semantics by Linear Programming

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/11799573_16openalex-snapshot
Justifications for Logic Programs Under Answer Set Semantics
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_45openalex-snapshot
On the Problem of Computing the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_29openalex-snapshot
Efficient Computation of the Well-Founded Model Using Update Propagation
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_14openalex-snapshot
High-Level Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-49795-1_20openalex-snapshot
Integrating the Completion and the Well Founded Semantics
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-3-030-68436-5_22-1openalex-snapshot
Default Negation in Normal Logic Programs Considered as Minimal Abduction of Positive Hypotheses
inferred← citeshttps://doi.org/10.1007/978-3-031-10135-9_22openalex-snapshot
Default Negation in Normal Logic Programs Considered as Minimal Abduction of Positive Hypotheses
inferred← citeshttps://doi.org/10.1007/978-3-031-74209-5_21openalex-snapshot
Semantic-Based Arguments Using Logic Programming Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-05258-3_2openalex-snapshot
Possibilistic Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-54370-8_1openalex-snapshot
Large-Scale Complex Reasoning with Semantics: Approaches and Challenges
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/bfb0054788openalex-snapshot
Knowledge representation with logic programs
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/j.ijar.2015.06.009openalex-snapshot
Semantic-based construction of arguments: An answer set programming approach
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/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.1023/a:1005952908693openalex-snapshot
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
inferred← citeshttps://doi.org/10.1093/logcom/exu014openalex-snapshot
Ideal extensions as logical programming models
inferred← citeshttps://doi.org/10.1109/micai.2011.31openalex-snapshot
Studying Ideal Semantics via Logic Programming Semantics
inferred← citeshttps://doi.org/10.1155/2018/4157030openalex-snapshot
Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.3233/aac-160004openalex-snapshot
An activity-centric argumentation framework for assistive technology aimed at improving health
inferred← citeshttps://doi.org/10.3233/aic-190622openalex-snapshot
Approximating agreements in formal argumentation dialogues1
inferred← citeshttps://doi.org/10.3233/fi-2011-388openalex-snapshot
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
inferred← citeshttps://doi.org/10.3233/fi-2011-598openalex-snapshot
A Possibilistic Argumentation Decision Making Framework with Default Reasoning
inferred← citeshttps://doi.org/10.4204/eptcs.416.12openalex-snapshot
Proceedings 40th International Conference on Logic Programming
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.