On the public citation graph

Generalizing updates: From models to programs

0 signed · 47 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-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/3-540-61630-6_10openalex-snapshot
Strong and explicit negation in non-monotonic reasoning and logic programming
inferredcites →https://doi.org/10.1007/bfb0021968openalex-snapshot
Revision specifications by means of programs
inferredcites →https://doi.org/10.1007/bfb0023804openalex-snapshot
Update-programms can update programs
inferredcites →https://doi.org/10.1016/s0743-1066(96)00091-xopenalex-snapshot
Update by means of inference rules
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.1109/tse.1985.232506openalex-snapshot
On the Use of an Extended Relational Model to Handle Changing Incomplete Information
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11533092_4openalex-snapshot
From Logic Programs Updates to Action Description Updates
inferred← citeshttps://doi.org/10.1007/11853886_5openalex-snapshot
An Event-Condition-Action Logic Programming Language
inferred← citeshttps://doi.org/10.1007/11961536_12openalex-snapshot
A Dynamic Logic Programming Based System for Agents with Declarative Goals
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-45329-6_19openalex-snapshot
Evolving Multi-agent Viewpoints — An Architecture
inferred← citeshttps://doi.org/10.1007/3-540-45329-6_27openalex-snapshot
A Modified Semantics for LUPS
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_27openalex-snapshot
Multi-dimensional Dynamic Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_15openalex-snapshot
Logic Programming Updating - A Guided Approach
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-319-61660-5_30openalex-snapshot
moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_4openalex-snapshot
Semantics for Dynamic Logic Programming: A Principle-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_38openalex-snapshot
On Some Differences Between Semantics of Logic Program Updates
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_29openalex-snapshot
Revision Programs with Explicit Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-70829-2_5openalex-snapshot
Collaborative vs. Conflicting Learning, Evolution and Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-540-71956-4_10openalex-snapshot
Adding Knowledge Updates to 3APL
inferred← citeshttps://doi.org/10.1007/978-3-540-88833-8_7openalex-snapshot
EVOLP: Tranformation-Based Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-18690-5_3openalex-snapshot
Declarative Update Policies for Nonmonotonic Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_14openalex-snapshot
Evolving Logic Programs with Temporal Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_29openalex-snapshot
A Unifying Perspective on Knowledge 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/s11225-005-0492-yopenalex-snapshot
The Refined Extension Principle for Semantics of Dynamic Logic Programming
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.1016/s1570-2464(02)80012-xopenalex-snapshot
Philosophical incidence of logic programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80586-3openalex-snapshot
A Language for Multi-dimensional Updates
inferred← citeshttps://doi.org/10.1017/s0269888915000132openalex-snapshot
Resolving conflicts in knowledge for ambient intelligence
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:1007681906490openalex-snapshot
Strategies in Combined Learning via Logic Programs
inferred← citeshttps://doi.org/10.1093/jigpal/jzs012openalex-snapshot
Dependency semantics for sequences of extended logic programs
inferred← citeshttps://doi.org/10.1109/micai.2011.18openalex-snapshot
Static and Dynamic Semantics: Preliminary Report
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9412openalex-snapshot
Partial Meet Revision and Contraction in Logic Programs
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-1-64-81openalex-snapshot
Default Negation as Explicit Negation plus Update
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-957openalex-snapshot
On Semantic Update Operators for Answer-Set Programs
inferred← citeshttps://doi.org/10.3233/ia-2011-0007openalex-snapshot
Evolving reactive logic programs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6784openalex-snapshot
On Strong and Default Negation in Logic Program Updates (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04912openalex-snapshot
Syntax-Preserving Belief Change Operators for Logic Programs
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.