On the public citation graph
Update-programms can update programs
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-53507-1_94openalex-snapshot
Drawing updates from derivations
inferredcites →https://doi.org/10.1007/3-540-58025-5_47openalex-snapshot
Contradiction: When avoidance equals removal Part I
inferredcites →https://doi.org/10.1007/3-540-58907-4_28openalex-snapshot
Revision programming, database updates and integrity constraints
inferredcites →https://doi.org/10.1007/3-540-59487-6_12openalex-snapshot
Update by means of inference rules
inferredcites →https://doi.org/10.1007/3-540-60983-0_7openalex-snapshot
Default negated conclusions: Why not?
inferredcites →https://doi.org/10.1007/bf00883931openalex-snapshot
A logic programming system for nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bfb0021968openalex-snapshot
Revision specifications by means of programs
inferredcites →https://doi.org/10.1007/bfb0021969openalex-snapshot
Revision of non-monotonic theories
inferredcites →https://doi.org/10.1016/0743-1066(93)90032-copenalex-snapshot
Non-monotonic reasoning with logic programming
inferredcites →https://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferredcites →https://doi.org/10.1017/cbo9780511526664.007openalex-snapshot
On the difference between updating a knowledge base and revising it
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/10703163_6openalex-snapshot
Revision Programming = Logic Programming + Integrity Constraints
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_30openalex-snapshot
A Kripkean Semantics for Dynamic Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_58openalex-snapshot
On Complexity of Updates through Integrity Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_15openalex-snapshot
Logic Programming Updating - A Guided Approach
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_5openalex-snapshot
Maximal Expansions of Database Updates
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_10openalex-snapshot
Monotone Expansion of Updates in Logical Databases
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_11openalex-snapshot
Updating Extended Logic Programs through Abduction
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_12openalex-snapshot
LUPS — A Language for Updating Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-12027-0_4openalex-snapshot
On Supporting Strong and Default Negation in Answer-Set Program Updates
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_50openalex-snapshot
Early Recovery in Logic Program Updates
inferred← citeshttps://doi.org/10.1007/bfb0054796openalex-snapshot
Generalizing updates: From models to programs
inferred← citeshttps://doi.org/10.1016/j.artint.2015.07.008openalex-snapshot
On updates of hybrid knowledge bases composed of ontologies and rules
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00183-2openalex-snapshot
LUPS—A language for updating logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00065-5openalex-snapshot
Dynamic updates of non-monotonic knowledge bases
inferred← citeshttps://doi.org/10.1017/s1471068401001247openalex-snapshot
On properties of update sequences based on causal rejection
inferred← citeshttps://doi.org/10.1017/s1471068402001576openalex-snapshot
Using methods of declarative logic programming for intelligent information agents
inferred← citeshttps://doi.org/10.1017/s1471068422000060openalex-snapshot
A Brief History of Updates of Answer-Set Programs
inferred← citeshttps://doi.org/10.1023/a:1005900924623openalex-snapshot
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1013112907978openalex-snapshot
Maximal state independent approximations to minimal real change
inferred← citeshttps://doi.org/10.1109/tcset.2006.4404436openalex-snapshot
Applicable Scaling of User Predicate Queries In Given Categorical Strategy and Restrictions System
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6784openalex-snapshot
On Strong and Default Negation in Logic Program Updates (Extended Version)
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.