On the public citation graph
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
0 signed · 85 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-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-53162-9_35openalex-snapshot
Fixpoint techniques for non-monotone maps
inferredcites →https://doi.org/10.1007/978-3-642-73385-7_3openalex-snapshot
Assumption-based Truth Maintenance
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1016/0004-3702(79)90008-0openalex-snapshot
A truth maintenance system
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(80)90013-2openalex-snapshot
The mathematics of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(82)90020-0openalex-snapshot
Rete: A fast algorithm for the many pattern/many object pattern match problem
inferredcites →https://doi.org/10.1016/0004-3702(85)90042-6openalex-snapshot
Semantical considerations on nonmonotonic logic
inferredcites →https://doi.org/10.1016/0004-3702(90)90086-fopenalex-snapshot
A rational reconstruction of nonmonotonic truth maintenance systems
inferredcites →https://doi.org/10.1016/0020-0190(82)90065-5openalex-snapshot
Fixed point theorems and semantics: a folk tale
inferredcites →https://doi.org/10.1016/0304-3975(89)90106-0openalex-snapshot
A sound and complete semantics for a version of negation as failure
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(89)90020-4openalex-snapshot
A completeness theorem for SLDNF resolution
inferredcites →https://doi.org/10.1016/0743-1066(89)90022-8openalex-snapshot
Signed data dependencies in logic programs
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/0743-1066(91)90026-lopenalex-snapshot
Magic templates: a spellbinding approach to logic programs
inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50013-9openalex-snapshot
Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1145/298514.298564openalex-snapshot
The expressive powers of the logic programming semantics (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.3233/fi-1987-10405openalex-snapshot
Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10704567_18openalex-snapshot
An Operational Semantics of Starlog
inferred← citeshttps://doi.org/10.1007/3-540-36524-9_14openalex-snapshot
Connecting Databases with Argumentation
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_16openalex-snapshot
Abduction in Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_2openalex-snapshot
A Correct goal-directed proof procedure for a general logic program with integrity constraints
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_41openalex-snapshot
A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_9openalex-snapshot
Solving air-traffic problems with “possible worlds”
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_154openalex-snapshot
The meaning of negative premises in transition system specifications II
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_44openalex-snapshot
A model theoretic approach to update rule programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_9openalex-snapshot
Integrity Constraints: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-31605-1_12openalex-snapshot
Legal Debugging in Propositional Legal Representation
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-14726-0_9openalex-snapshot
Stability, Supportedness, Minimality and Kleene Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_22openalex-snapshot
A Formal Theory of Justifications
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-15025-8_24openalex-snapshot
Thirteen Definitions of a Stable Model
inferred← citeshttps://doi.org/10.1007/978-3-642-28067-2_10openalex-snapshot
Analyzing Pathways Using ASP-Based Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_41openalex-snapshot
Concrete Results on Abstract Rules
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_8openalex-snapshot
A Survey of Paraconsistent Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/bf02939504openalex-snapshot
Bottom-up evaluation of datalog with negation
inferred← citeshttps://doi.org/10.1007/bfb0023806openalex-snapshot
Update programs versus revision programs
inferred← citeshttps://doi.org/10.1007/bfb0030666openalex-snapshot
Computing stable and partial stable models of extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/s10601-016-9257-7openalex-snapshot
What is answer set programming to propositional satisfiability
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.artint.2011.11.001openalex-snapshot
Ordered completion for first-order logic programs on finite structures
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.007openalex-snapshot
The meaning of negative premises in transition system specifications II
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00709-0openalex-snapshot
Generalized metrics and uniquely determined logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00076-xopenalex-snapshot
Computing abduction by using TMS with top-down expectation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80047-7openalex-snapshot
On the Coincidence of Semantics for Uniquely Determined Programs
inferred← citeshttps://doi.org/10.1017/s1471068401001375openalex-snapshot
A logic-based approach to data integration
inferred← citeshttps://doi.org/10.1017/s1471068411000597openalex-snapshot
Reasoning with Forest Logic Programs and f-hybrid knowledge bases
inferred← citeshttps://doi.org/10.1017/s1471068414000234openalex-snapshot
Causal Graph Justifications of Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068417000369openalex-snapshot
Finite model reasoning over existential rules
inferred← citeshttps://doi.org/10.1017/s1471068423000224openalex-snapshot
On Program Completion, with an Application to the Sum and Product Puzzle
inferred← citeshttps://doi.org/10.1080/11663081.2014.911520openalex-snapshot
Modeling the suppression task under weak completion and well-founded semantics
inferred← citeshttps://doi.org/10.1093/logcom/5.3.265openalex-snapshot
Paraconsistent Stable Semantics for Extended Disjunctive Programs
inferred← citeshttps://doi.org/10.1109/cisis.2014.76openalex-snapshot
Logical Modelling of Inhibition and Competition in Biochemical Networks
inferred← citeshttps://doi.org/10.1109/lics.1996.561457openalex-snapshot
Semantics of normal logic programs and contested information
inferred← citeshttps://doi.org/10.1145/1140335.1140361openalex-snapshot
Inferring dynamic credentials for rôle-based trust management
inferred← citeshttps://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11540openalex-snapshot
Externally Supported Models for Efficient Computation of Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.24963/ijcai.2018/719openalex-snapshot
Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward
inferred← citeshttps://doi.org/10.3233/fi-1999-40103openalex-snapshot
Processing Deductive Databases under the Disjunctive Stable Model Semantics
inferred← citeshttps://doi.org/10.3233/fun-2002-49404openalex-snapshot
Processing Indefinite Deductive Databases under the Possible Model Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.416.16openalex-snapshot
Graphical Conditions for the Existence, Unicity and Number of Regular Models
inferred← citeshttps://doi.org/10.48550/arxiv.1409.7281openalex-snapshot
Causal Graph Justifications of Logic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00724openalex-snapshot
A lemma on closures and its application to modularity in logic programming semantics
inferred← citeshttps://doi.org/10.5821/dissertation-2117-112216openalex-snapshot
Incremental checking and maintenance of UML/OCL integrity constraints
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7551/mitpress/4307.003.0018openalex-snapshot
A Characterization of Stable Models Using a Non-monotonic Operator
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.