On the public citation graph

From the past to the future: Executing temporal logic programs

0 signed · 32 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-15670-4_6openalex-snapshot
Executing temporal logic programs
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-51803-7openalex-snapshot
Temporal Logic in Specification
inferredcites →https://doi.org/10.1007/3-540-51803-7_36openalex-snapshot
The declarative past and imperative future
inferredcites →https://doi.org/10.1007/3-540-52559-9_62openalex-snapshot
MetateM: A framework for programming in temporal logic
inferredcites →https://doi.org/10.1007/978-1-4471-3494-7_20openalex-snapshot
A Method for the Determinisation of Propositional Temporal Formulae
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(89)80070-7openalex-snapshot
Temporal logic programming
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1996.0066openalex-snapshot
Temporal Annotated Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/11678823_1openalex-snapshot
MetateM: The Story so Far
inferred← citeshttps://doi.org/10.1007/11750734_8openalex-snapshot
Implementing Temporal Logics: Tools for Execution and Proof
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_15openalex-snapshot
Concurrent MetateM — A language for modelling reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_35openalex-snapshot
Specifying and verifying distributed Intelligent systems
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_17openalex-snapshot
Annotated constraint logic programming applied to temporal reasoning
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/3-540-58976-7_6openalex-snapshot
Towards a semantics for concurrent MetateM
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_7openalex-snapshot
Constraint deduction in an interval-based temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_8openalex-snapshot
Towards first-order concurrent MetateM
inferred← citeshttps://doi.org/10.1007/978-3-540-74459-7_20openalex-snapshot
Modelling and Monitoring Social Expectations in Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21268-0_15openalex-snapshot
Initial Steps Towards Run-Time Support for Norm-Governed Systems
inferred← citeshttps://doi.org/10.1007/bf01211631openalex-snapshot
MetateM: An introduction
inferred← citeshttps://doi.org/10.1007/bfb0013043openalex-snapshot
Logic Programming and Automated Reasoning
inferred← citeshttps://doi.org/10.1007/bfb0014005openalex-snapshot
A survey of concurrent MetateM — The language and its applications
inferred← citeshttps://doi.org/10.1007/s10458-004-3140-4openalex-snapshot
Temporal Development Methods for Agent-Based
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1093/logcom/7.4.429openalex-snapshot
A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution
inferred← citeshttps://doi.org/10.1093/logcom/exq055openalex-snapshot
Verifying social expectations by model checking truncated paths
inferred← citeshttps://doi.org/10.1109/time.1997.600776openalex-snapshot
Automata representations for Concurrent METATEM
inferred← citeshttps://doi.org/10.14236/ewic/fa1996.8openalex-snapshot
Towards Formal Methods for Agent-Based Systems
inferred← citeshttps://doi.org/10.4324/9780203993699-23openalex-snapshot
A logical approach to simulating societies
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.