On the public citation graph
Disjunctive LP+integrity constraints= stable model semantics
0 signed · 55 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/978-1-4612-5196-5_8openalex-snapshot
Towards a Logical Reconstruction of Relational Database Theory
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_4openalex-snapshot
Logic for Data Description
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
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/0304-3975(92)90019-copenalex-snapshot
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90049-9openalex-snapshot
What should a database know?
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.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.21236/ada299227openalex-snapshot
Computation and Implementation of Non-Monotonic Deductive Databases.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_25openalex-snapshot
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_15openalex-snapshot
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_31openalex-snapshot
Semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_1openalex-snapshot
On extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_8openalex-snapshot
The stable semantics and its variants: A comparison of recent approaches
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-03014-8_3openalex-snapshot
Computing Logic Programming Semantics in Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_7openalex-snapshot
Answer Set Programming Made Easy
inferred← citeshttps://doi.org/10.1007/978-3-319-63558-3_44openalex-snapshot
Linear Algebraic Characterization of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-39615-4_7openalex-snapshot
Model and Fixpoint Semantics for Fuzzy Disjunctive Programs with Weak Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-75410-7_17openalex-snapshot
Consistent Data Integration in P2P Deductive Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf00244495openalex-snapshot
Model theoretic approach to view updates in deductive databases
inferred← citeshttps://doi.org/10.1007/bf00881914openalex-snapshot
Ordered model trees: A normal form for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bf00881915openalex-snapshot
An alternative approach to the semantics of disjunctive logic programs and deductive databases
inferred← citeshttps://doi.org/10.1007/bf00962069openalex-snapshot
Processing negation and disjunction in logic programs through integrity constraints
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
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/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1007/bfb0054790openalex-snapshot
Partial evidential stable models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/s10472-021-09767-xopenalex-snapshot
Logic programming in tensor spaces
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00216-9openalex-snapshot
Computing minimal models by partial instantiation
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90028-fopenalex-snapshot
An overview of nonmonotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00119-0openalex-snapshot
A fixpoint characterization of abductive logic programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.036openalex-snapshot
On reasoning about structural equality in XML: a description logic approach
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00073-4openalex-snapshot
Abductive logic programming and disjunctive logic programming: their relationship and transferability
inferred← citeshttps://doi.org/10.1023/a:1013180132511openalex-snapshot
Using clausal deductive databases for defining semantics in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1093/logcom/5.3.265openalex-snapshot
Paraconsistent Stable Semantics for Extended Disjunctive Programs
inferred← citeshttps://doi.org/10.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferred← citeshttps://doi.org/10.1109/ictai.2012.167openalex-snapshot
A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1995.tb00024.xopenalex-snapshot
COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES
inferred← citeshttps://doi.org/10.1145/195613.195637openalex-snapshot
Mixed integer programming methods for computing nonmonotonic deductive databases
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
inferred← citeshttps://doi.org/10.3233/fi-1997-32205openalex-snapshot
Combining Closed World Assumptions with Stable Negation
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.