On the public citation graph
Improving temporal logic tableaux using integer constraints
0 signed · 22 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-56944-8_50openalex-snapshot
Verification of Switch-level designs with many-valued logic
inferredcites →https://doi.org/10.1007/3-540-57322-4_18openalex-snapshot
A new translation from deduction into integer programming
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferredcites →https://doi.org/10.1109/lics.1990.113764openalex-snapshot
Real-time logics: complexity and expressiveness
inferredcites →https://doi.org/10.1145/123186.123223openalex-snapshot
Sequential circuit verification using symbolic model checking
inferredcites →https://doi.org/10.1145/195613.195637openalex-snapshot
Mixed integer programming methods for computing nonmonotonic deductive databases
inferredcites →https://doi.org/10.21236/ada323441openalex-snapshot
Real-Time Logics: Complexity and Expressiveness,
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-48242-3_5openalex-snapshot
First Order Linear Temporal Logic over Finite Time Structures
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_31openalex-snapshot
Deduction by combining semantic tableaux and integer programming
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_22openalex-snapshot
Temporal reasoning over linear discrete time
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_18openalex-snapshot
Bounded Model Search in Linear Temporal Logic and Its Application to Planning
inferred← citeshttps://doi.org/10.1007/978-3-7091-9394-5_6openalex-snapshot
Automated Deduction and Integer Programming
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_6openalex-snapshot
Labelled Tableaux for Propositional Linear Time Logic Over Finite Frames
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1007/bfb0035385openalex-snapshot
A tableau system for linear-TIME temporal logic
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.012openalex-snapshot
A general tableau method for propositional interval temporal logics: Theory and implementation
inferred← citeshttps://doi.org/10.1093/logcom/exp022openalex-snapshot
Labelled Tableaux for Distributed Temporal Logic
inferred← citeshttps://doi.org/10.1109/time.2008.21openalex-snapshot
A Labeled Tableaux System for the Distributed Temporal Logic DTL
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.