On the public citation graph
Formalizing a logic for logic programming
0 signed · 69 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.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
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/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/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/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
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.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-13105openalex-snapshot
Some Remarks on the Completed Database1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferred← citeshttps://doi.org/10.1007/11762256_26openalex-snapshot
Rules with Contextually Scoped Negation
inferred← citeshttps://doi.org/10.1007/3-540-49795-1_20openalex-snapshot
Integrating the Completion and the Well Founded Semantics
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_112openalex-snapshot
The strong semantics for 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/3-540-58495-1_51openalex-snapshot
Partial evaluation and relevance for approximations of the stable semantics
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_18openalex-snapshot
Default consequence relations as a logical framework for logic programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24694-7_21openalex-snapshot
Closing the Gap between the Stable Semantics and Extensions of WFS
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_35openalex-snapshot
Three Valued Logic of Łukasiewicz for Modeling Semantics of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-23032-5_6openalex-snapshot
Rules and Logic Programming for the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_13openalex-snapshot
A Disjunctive Semantics Based on Unfolding and Bottom-Up Evaluation
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/bf01536398openalex-snapshot
Complexity and undecidability results for logic programming
inferred← citeshttps://doi.org/10.1007/bf01928539openalex-snapshot
The strong semantics for logic programs
inferred← citeshttps://doi.org/10.1007/bf03037222openalex-snapshot
Aggregation and negation-as-failure
inferred← citeshttps://doi.org/10.1007/bfb0023800openalex-snapshot
On logics and semantics for general logic programs
inferred← citeshttps://doi.org/10.1007/bfb0023802openalex-snapshot
Aggregation and well-founded semantics+
inferred← citeshttps://doi.org/10.1007/bfb0030657openalex-snapshot
An argumentation theoretic semantics based on non-refutable falsity
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90030-kopenalex-snapshot
Commonsense axiomatizations for logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00022-xopenalex-snapshot
Autoepistemic logics as a unifying framework for the semantics of logic programs
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50103-2openalex-snapshot
On the Relation Between Default and Modal Consequence Relations
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50123-8openalex-snapshot
On Positive Occurrences of Negation as Failure
inferred← citeshttps://doi.org/10.1016/j.jal.2009.12.001openalex-snapshot
Equivalence for the G 3 ′ -stable models semantics
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00044-0openalex-snapshot
A general theory of confluent rewriting systems for logic programming and its applications
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10001-2openalex-snapshot
Negation as failure in the head
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.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.1093/logcom/13.3.405openalex-snapshot
Collective Argumentation and Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1093/logcom/exi042openalex-snapshot
Ground Nonmonotonic Modal Logic S5: New Results
inferred← citeshttps://doi.org/10.1093/logcom/exu014openalex-snapshot
Ideal extensions as logical programming models
inferred← citeshttps://doi.org/10.1109/enc.2013.18openalex-snapshot
Complete Extensions as Clark's Completion Semantics
inferred← citeshttps://doi.org/10.1145/137097.137115openalex-snapshot
The valid model semantics for logic programs
inferred← citeshttps://doi.org/10.1145/143559.143687openalex-snapshot
On the relationship between circumscription and well-founded semantics of logic programs
inferred← citeshttps://doi.org/10.1145/288627.288694openalex-snapshot
Providing semantics for indefinite deductive databases
inferred← citeshttps://doi.org/10.1145/503720.503773openalex-snapshot
The BLM semantics may be inconsistent
inferred← citeshttps://doi.org/10.13053/rcs-148-3-26openalex-snapshot
Béziau’s SP3A Logic and Logic Programming
inferred← citeshttps://doi.org/10.3233/fi-1995-2233openalex-snapshot
A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES
inferred← citeshttps://doi.org/10.3233/fi-1996-281205openalex-snapshot
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
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-2011-388openalex-snapshot
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
inferred← citeshttps://doi.org/10.3233/fi-2017-1586openalex-snapshot
Abducible Semantics and Argumentation
inferred← citeshttps://doi.org/10.3745/kipstd.2002.9d.2.243openalex-snapshot
Inclusive and Exclusive or Interpretation for Indefinite 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.