On the public citation graph

Default theory for Well Founded Semantics with explicit negation

0 signed · 22 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-54009-1_25openalex-snapshot
A database needs two kinds of negation
inferredcites →https://doi.org/10.1007/bf00881799openalex-snapshot
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf02341854openalex-snapshot
Stable and extension class theory for logic programs and default logics
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0890-5401(91)90073-bopenalex-snapshot
General logical databases and programs: Default logic semantics and stratification
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs

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-58095-6_7openalex-snapshot
Contradiction removal semantics with explicit negation
inferred← citeshttps://doi.org/10.1007/3-540-58095-6_8openalex-snapshot
Logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_27openalex-snapshot
Nonmonotonicity and answer set inference
inferred← citeshttps://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf02916841openalex-snapshot
Consistency-based abduction with extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0021967openalex-snapshot
Belief, provability, and logic programs
inferred← citeshttps://doi.org/10.1007/bfb0030657openalex-snapshot
An argumentation theoretic semantics based on non-refutable falsity
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90032-copenalex-snapshot
Non-monotonic reasoning with logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/j.jal.2004.07.012openalex-snapshot
An encompassing framework for Paraconsistent Logic Programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00004-7openalex-snapshot
Graph theoretical structures in logic programs and default theories
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00141-0openalex-snapshot
Representing actions: Laws, observations and hypotheses
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510842openalex-snapshot
Belief, provability, and logic programs
inferred← citeshttps://doi.org/10.1109/69.667094openalex-snapshot
Coherence approach to logic program revision
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1994.tb00168.xopenalex-snapshot
DEFAULT LOGICS: A UNIFIED VIEW
inferred← citeshttps://doi.org/10.3233/fi-1994-21124openalex-snapshot
STATIONARY DEFAULT EXTENSIONS
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.