On the public citation graph

Static semantics for normal and disjunctive logic programs

https://doi.org/10.1007/bf01530826
0 signed · 99 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-52885-7_82openalex-snapshot
Generalized well-founded semantics for logic programs
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/3-540-61630-6_10openalex-snapshot
Strong and explicit negation in non-monotonic reasoning and logic programming
inferredcites →https://doi.org/10.1007/978-3-662-02906-0openalex-snapshot
Nonmonotonic Logic
inferredcites →https://doi.org/10.1007/bf00248321openalex-snapshot
Weak Generalized Closed World Assumption
inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1007/bf00881833openalex-snapshot
Autoepistemic circumscription and logic programming
inferredcites →https://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bfb0023437openalex-snapshot
Default theory for Well Founded Semantics with explicit negation
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(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/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
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.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot
Autoepistemic logic of knowledge and beliefs
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.21236/ada232064openalex-snapshot
Generalized Disjunctive Well-Founded Semantics for Logic Programs
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.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/11562931_26openalex-snapshot
A Well-Founded Semantics with Disjunction
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_10openalex-snapshot
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_7openalex-snapshot
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
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-45744-5_22openalex-snapshot
A Top-Down Procedure for Disjunctive Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_9openalex-snapshot
The Well-Founded Semantics in Normal Logic Programs with Uncertainty
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_12openalex-snapshot
Update by means of inference rules
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_17openalex-snapshot
On the extension of logic programming with negation through uniform proofs
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_7openalex-snapshot
Characterizations of the stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1007/3-540-60428-6_4openalex-snapshot
Belief revision in non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_11openalex-snapshot
Proof-theory for extensions of Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_7openalex-snapshot
Default negated conclusions: Why not?
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_18openalex-snapshot
A tableau calculus for minimal model reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_10openalex-snapshot
Strong and explicit negation in non-monotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_19openalex-snapshot
Characterizing D-WFS: Confluence and iterated GCWA
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_42openalex-snapshot
DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_10openalex-snapshot
Separating disbeliefs from beliefs in autoepistemic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_12openalex-snapshot
A study of Przymusinski's static semantics
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_27openalex-snapshot
A deductive system for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3540634932_7openalex-snapshot
Minimal model generation based on E-hyper tableaux
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_10openalex-snapshot
Logical Approaches to Incomplete Information: A Survey
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-72200-7_6openalex-snapshot
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_1openalex-snapshot
Foundations of Rule-Based Query Answering
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-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
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/bf00883931openalex-snapshot
A logic programming system for nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1007/bf01530784openalex-snapshot
Well-founded and stationary models of logic programs
inferred← citeshttps://doi.org/10.1007/bf02948986openalex-snapshot
Closed world assumption for disjunctive reasoning
inferred← citeshttps://doi.org/10.1007/bfb0021967openalex-snapshot
Belief, provability, and logic programs
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0023800openalex-snapshot
On logics and semantics for general 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/bfb0030661openalex-snapshot
Logic programming with assumption denial
inferred← citeshttps://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferred← citeshttps://doi.org/10.1007/bfb0030664openalex-snapshot
Static semantics as program transformation and well-founded computation
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0054790openalex-snapshot
Partial evidential stable models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0054791openalex-snapshot
Disjunctive logic programming and autoepistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0055020openalex-snapshot
Disjunctive logic programming and possible model semantics
inferred← citeshttps://doi.org/10.1007/bfb0058028openalex-snapshot
An abductive semantics for disjunctive logic programs and its proof procedure
inferred← citeshttps://doi.org/10.1007/s00153-022-00821-xopenalex-snapshot
Disjunctive logic programs, answer sets, and the cut rule
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/s0004-3702(03)00078-xopenalex-snapshot
Enhancing disjunctive logic programming systems by SAT checkers
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot
Autoepistemic logic of knowledge and beliefs
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00043-0openalex-snapshot
Computation of the semantics of autoepistemic belief theories
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.1016/s0304-3975(00)00045-1openalex-snapshot
On the equivalence of the static and disjunctive well-founded semantics and its computation
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00091-xopenalex-snapshot
Update by means of inference rules
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10005-xopenalex-snapshot
A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10006-1openalex-snapshot
A logical foundation for logic programming II: Semantics of general logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10030-4openalex-snapshot
Semantics of (disjunctive) logic programs based on partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00074-6openalex-snapshot
An abductive approach to disjunctive logic programming
inferred← citeshttps://doi.org/10.1017/s1471068404002273openalex-snapshot
Optimization of bound disjunctive queries with constraints
inferred← citeshttps://doi.org/10.1023/a:1005900924623openalex-snapshot
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming
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:1011271902410openalex-snapshot
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510842openalex-snapshot
Belief, provability, and logic programs
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.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185840openalex-snapshot
Binding propagation techniques for the optimization of bound disjunctive queries
inferred← citeshttps://doi.org/10.1145/1055686.1055690openalex-snapshot
Comparisons and computation of well-founded semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1145/1149114.1149117openalex-snapshot
The DLV system for knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1145/2422085.2422088openalex-snapshot
Computing Loops with at Most One External Support Rule
inferred← citeshttps://doi.org/10.1145/261124.261126openalex-snapshot
Disjunctive datalog
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/963927.963931openalex-snapshot
Super logic programs
inferred← citeshttps://doi.org/10.14236/ewic/adbis1996.12openalex-snapshot
Disjunctive Rules and Null Values: Logic Programs with Incomplete Information
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5676openalex-snapshot
Complexity and Expressive Power of Disjunction and Negation in Limit Datalog
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
inferred← citeshttps://doi.org/10.3233/fi-1996-281201openalex-snapshot
Belief Revision in Non-Monotonic Reasoning and Logic Programming
inferred← citeshttps://doi.org/10.3233/fun-2005-67401openalex-snapshot
A New Partial Semantics for Disjunctive Deductive Databases
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.