On the public citation graph
Modal provability foundations for negation by failure
0 signed · 42 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-4613-8601-8openalex-snapshot
Self-Reference and Modal Logic
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_9openalex-snapshot
Modal Logic and Self-Reference
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/0304-3975(85)90128-8openalex-snapshot
Optimal fixedpoints of logic programs
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(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.1016/0743-1066(86)90002-6openalex-snapshot
Negation as inconsistency. I
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(87)90018-5openalex-snapshot
A note on the complexity of the satisfiability of modal Horn clauses
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferredcites →https://doi.org/10.1016/s0049-237x(09)70653-6openalex-snapshot
What is Negation in a System?
inferredcites →https://doi.org/10.1016/s0743-1066(85)80003-0openalex-snapshot
N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1093/logcom/1.3.331openalex-snapshot
Modal Logic and Negation as Failure
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1305/ndjfl/1093637556openalex-snapshot
Quantified modal logic and self-reference.
inferredcites →https://doi.org/10.2307/2274450openalex-snapshot
C. Smoryński. Self-reference and modal logic. Universitext. Springer-Verlag, New York, Berlin, etc., 1985, xii + 333 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-54507-7_19openalex-snapshot
Negation as failure and intuitionistic three-valued logic
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_2openalex-snapshot
Metaprogramming through intensional deduction: Some examples
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_20openalex-snapshot
Logics for Negation as Failure
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_9openalex-snapshot
Sixty Years of Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-642-29414-3_5openalex-snapshot
What Is Negation as Failure?
inferred← citeshttps://doi.org/10.1007/978-3-642-75591-0_5openalex-snapshot
Dialogue Models for Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-94-011-4574-9_2openalex-snapshot
Research Themes of Dov Gabbay
inferred← citeshttps://doi.org/10.1007/978-94-015-9309-0_8openalex-snapshot
From Here to There: Stable Negation in Logic Programming
inferred← citeshttps://doi.org/10.1007/bfb0020826openalex-snapshot
A modal semantics for the negation as failure and the closed world assumption rules
inferred← citeshttps://doi.org/10.1007/s11225-009-9215-0openalex-snapshot
Modal Provability Foundations for Argumentation Networks
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferred← citeshttps://doi.org/10.1016/s1874-5857(08)80016-7openalex-snapshot
Hugh Maccoll and the Birth of Logical Pluralism
inferred← citeshttps://doi.org/10.1093/logcom/exad020openalex-snapshot
Nonmonotonic inferences: Classical conclusions in an intuitionistic modal framework
inferred← citeshttps://doi.org/10.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferred← citeshttps://doi.org/10.2307/2275363openalex-snapshot
Nonmonotonic consequence based on intuitionistic logic
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.