On the public citation graph
Tim: The toulouse inference machine for non-classical logic programming
0 signed · 20 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-16492-8_119openalex-snapshot
Tokio: Logic programming language based on temporal logic and its compilation to Prolog
inferredcites →https://doi.org/10.1007/3-540-18024-9_24openalex-snapshot
Programming in modal logic: An extension of PROLOG based on modal logic
inferredcites →https://doi.org/10.1007/bf03037381openalex-snapshot
MOLOG: A system that extends PROLOG with modal logic
inferredcites →https://doi.org/10.1016/0020-0190(82)90085-0openalex-snapshot
A simple deduction method for modal logic
inferredcites →https://doi.org/10.1016/0166-218x(90)90119-wopenalex-snapshot
Logic-based knowledge representation
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.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
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-56282-6_2openalex-snapshot
Metaprogramming through intensional deduction: Some examples
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_1openalex-snapshot
An introduction to executable modal and temporal logics
inferred← citeshttps://doi.org/10.1007/bfb0014004openalex-snapshot
An overview of temporal and modal logic programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.026openalex-snapshot
Multimodal logic programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00048-0openalex-snapshot
Multi-dimensional logic programming: theoretical foundations
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1080/11663081.2017.1420591openalex-snapshot
Society semantics and the logic way to collective intelligence
inferred← citeshttps://doi.org/10.1109/micai.2012.11openalex-snapshot
A Dynamic Logic-Based Modal Prolog
inferred← citeshttps://doi.org/10.3166/jancl.13.133-164openalex-snapshot
CWA Extensions to Multi-Valued Logics
inferred← citeshttps://doi.org/10.3166/jancl.19.167-181openalex-snapshot
Modal logic programming revisited
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.