On the public citation graph

Non-Monotonic Extensions of Logic Programming

https://doi.org/10.1007/bfb0023798
0 signed · 64 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/bfb0023802openalex-snapshot
Aggregation and well-founded semantics+
inferredcites →https://doi.org/10.1007/bfb0023803openalex-snapshot
Nonmonotonic reasoning by monotonic inferences with priority constraints
inferredcites →https://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot
Autoepistemic logic of knowledge and beliefs
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/10722086_28openalex-snapshot
A Tableau Calculus for Equilibrium Entailment
inferred← citeshttps://doi.org/10.1007/11546207_10openalex-snapshot
Answer Sets for Propositional Theories
inferred← citeshttps://doi.org/10.1007/11546207_22openalex-snapshot
Nested Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1007/11546207_27openalex-snapshot
Routley Semantics for Answer Sets
inferred← citeshttps://doi.org/10.1007/11546207_7openalex-snapshot
On Modular Translations and Strong Equivalence
inferred← citeshttps://doi.org/10.1007/11552222_5openalex-snapshot
Ten Theses on Logic Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/11874850_63openalex-snapshot
Strong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_4openalex-snapshot
Semantics of Partial-Order Programs
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_19openalex-snapshot
On conservative enforced updates
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_24openalex-snapshot
A Free Logic for Stable Models with Partial Intensional Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_18openalex-snapshot
Uniform Equivalence for Equilibrium Logic and Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_25openalex-snapshot
Strong Equivalence for Causal Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_15openalex-snapshot
Simplifying Logic Programs Under Answer Set Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_15openalex-snapshot
Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_69openalex-snapshot
tabeql: A Tableau Based Suite for Equilibrium Logic
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-72200-7_17openalex-snapshot
A Characterization of Strong Equivalence for Logic Programs with Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-72982-2_5openalex-snapshot
Quantified Equilibrium Logic and Hybrid Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_31openalex-snapshot
Temporal Equilibrium Logic: A First Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_3openalex-snapshot
Strongly Equivalent Temporal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_34openalex-snapshot
Rule Calculus: Semantics, Axioms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_36openalex-snapshot
Partial Functions and Equality in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_46openalex-snapshot
Quantified Equilibrium Logic and Foundations for Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_8openalex-snapshot
Twelve Definitions of a Stable Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_1openalex-snapshot
Well-Founded and Partial Stable Semantics Logical Aspects
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_17openalex-snapshot
On Reductive Semantics of Aggregates in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-05082-4_10openalex-snapshot
Answer Sets in a Fuzzy Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_24openalex-snapshot
Thirteen Definitions of a Stable Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_16openalex-snapshot
Back and Forth between Rules and SE-Models
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_23openalex-snapshot
Contingency-Based Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_43openalex-snapshot
STeLP – A Tool for Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_9openalex-snapshot
Loop Formulas for Splitable Temporal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_5openalex-snapshot
Datalog Programs and Their Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_10openalex-snapshot
The Modal Logic of Equilibrium Models
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_1openalex-snapshot
To Vladimir Lifschitz on His 65th Birthday
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_13openalex-snapshot
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_18openalex-snapshot
Bi-state Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_37openalex-snapshot
Connecting First-Order ASP and the Logic FO(ID) through Reducts
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_7openalex-snapshot
Here and There among Logics for Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_5openalex-snapshot
Automata-Based Computation of Temporal Equilibrium Models
inferred← citeshttps://doi.org/10.1007/978-3-642-34922-5_15openalex-snapshot
Fuzzy Answer Set Programming: An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_3openalex-snapshot
Integrating Temporal Extensions of Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_38openalex-snapshot
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
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-044450813-3/50021-7openalex-snapshot
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.011openalex-snapshot
Stable models and circumscription
inferred← citeshttps://doi.org/10.1016/j.artint.2017.02.002openalex-snapshot
Infinitary equilibrium logic and strongly equivalent logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103249openalex-snapshot
Autoepistemic equilibrium logic and epistemic specifications
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/j.ipl.2009.02.002openalex-snapshot
Strong equivalence of logic programs under the infinite-valued semantics
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00207-2openalex-snapshot
Logic programming and knowledge representation—The A-Prolog perspective
inferred← citeshttps://doi.org/10.1016/s0360-8352(97)00040-5openalex-snapshot
Specification and computation of optimization problems
inferred← citeshttps://doi.org/10.1017/s1471068414000088openalex-snapshot
On equivalence of infinitary formulas under the stable model semantics
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.1023/a:1007681906490openalex-snapshot
Strategies in Combined Learning via Logic Programs
inferred← citeshttps://doi.org/10.1080/11663081.2017.1307657openalex-snapshot
The discovery/justification context dichotomy within formal and computational models of scientific theories: a weakening of the distinction based on the perspective of non-monotonic logics
inferred← citeshttps://doi.org/10.1145/963927.963931openalex-snapshot
Super 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.