On the public citation graph
Well-founded and stationary models of logic programs
0 signed · 71 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-50701-9_16openalex-snapshot
General theory of cumulative inference
inferredcites →https://doi.org/10.1007/3-540-55015-1_5openalex-snapshot
Semantics of disjunctive logic programs and deductive databases
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
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.1007/bf00881799openalex-snapshot
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bfb0013044openalex-snapshot
Soundness and completeness of partial deductions for well-founded semantics
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)90014-4openalex-snapshot
A logic for default reasoning
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(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferredcites →https://doi.org/10.1016/0004-3702(90)90057-7openalex-snapshot
A skeptical theory of inheritance in nonmonotonic semantic networks
inferredcites →https://doi.org/10.1016/0004-3702(91)90011-8openalex-snapshot
Hard problems for simple default logics
inferredcites →https://doi.org/10.1016/0004-3702(91)90013-aopenalex-snapshot
Three-valued nonmonotonic formalisms and semantics of logic programs
inferredcites →https://doi.org/10.1016/0020-0190(91)90012-7openalex-snapshot
A simple fixed point characterization of three-valued stable model semantics
inferredcites →https://doi.org/10.1016/0743-1066(84)90023-2openalex-snapshot
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
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)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
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.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
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/b978-0-934613-40-8.50008-7openalex-snapshot
On the Declarative Semantics of Logic Programs with Negation
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1111/j.1467-8640.1991.tb00389.xopenalex-snapshot
Making default inferences from logic programs
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The 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/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
inferredcites →https://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferredcites →https://doi.org/10.1145/73721.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferredcites →https://doi.org/10.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferredcites →https://doi.org/10.3233/fi-1990-13106openalex-snapshot
Weakly Stratified Logic Programs1
inferredcites →https://doi.org/10.3233/fi-1990-13404openalex-snapshot
Well-Founded Semantics Coincides with Three-Valued Stable Semantics1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11853886_9openalex-snapshot
On the Logic and Computation of Partial Equilibrium Models
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_10openalex-snapshot
Partial Models of Extended Generalized Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_80openalex-snapshot
Partial Stable Generated Models of Generalized Logic Programs with Constraints
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_10openalex-snapshot
Loop checking and the well-founded semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-36755-8_8openalex-snapshot
Knowledge of Uncertain Worlds: Programming with Logical Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_11openalex-snapshot
Recursive Rules with Aggregation: A Simple Unified Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-21542-6_24openalex-snapshot
Representing Flexible Role-Based Access Control Policies Using Objects and Defeasible Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-72056-2_14openalex-snapshot
Founded Semantics and Constraint Semantics of Logic Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_6openalex-snapshot
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_12openalex-snapshot
Snapshot Generation in a Constructive Object-Oriented Modeling Language
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_35openalex-snapshot
Logic Programming with Defaults and Argumentation Theories
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_41openalex-snapshot
Layer Supported Models of Logic Programs
inferred← citeshttps://doi.org/10.1007/bfb0030659openalex-snapshot
Samantics of normal and disjunctive logic programs a unifying framework
inferred← citeshttps://doi.org/10.1007/bfb0031750openalex-snapshot
The limits of fixed-order computation
inferred← citeshttps://doi.org/10.1016/s0169-023x(01)00023-4openalex-snapshot
Constructing interpretations of deductive databases using reduction and dynamic stratification
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00026-8openalex-snapshot
Top-down query processing in indefinite stratified databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(99)00015-4openalex-snapshot
On cyclic covers and perfect models
inferred← citeshttps://doi.org/10.1017/s1471068409003792openalex-snapshot
Efficient description logic reasoning in Prolog: The DLog system
inferred← citeshttps://doi.org/10.1080/11663081.2013.798959openalex-snapshot
The infinite-valued semantics: overview, recent results and future directions
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/exaa056openalex-snapshot
Founded semantics and constraint semantics of logic rules
inferred← citeshttps://doi.org/10.1093/logcom/exaa077openalex-snapshot
Knowledge of uncertain worlds: programming with logical constraints
inferred← citeshttps://doi.org/10.1093/logcom/exac072openalex-snapshot
Recursive rules with aggregation: a simple unified semantics
inferred← citeshttps://doi.org/10.1145/3191315.3191326openalex-snapshot
Logic programming applications: what are the abstractions and implementations?
inferred← citeshttps://doi.org/10.3233/fi-1996-283402openalex-snapshot
On a Logical Basis of Normal Logic Programs
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.3233/fun-2006-73301openalex-snapshot
Logic Programming Representation of the Compound Term Composition Algebra
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.162openalex-snapshot
Transaction Logic with Defaults and Argumentation Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1905.04422openalex-snapshot
Controlled Natural Languages and Default Reasoning
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.