On the public citation graph

MetateM: An introduction

0 signed · 96 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-15648-8_16openalex-snapshot

The glory of the past

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-17945-3_16openalex-snapshot

Parallel programming in Temporal Logic

inferredcites →https://doi.org/10.1007/3-540-50403-6_35openalex-snapshot

Executing temporal logic: Review and prospects

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-52148-8_12openalex-snapshot

Fair SMG and linear time model checking

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/3-540-55602-8_178openalex-snapshot

A normal form for first-order temporal formulae

inferredcites →https://doi.org/10.1007/3-540-56891-3_15openalex-snapshot

Concurrent MetateM — A language for modelling reactive systems

inferredcites →https://doi.org/10.1007/3-540-58976-7openalex-snapshot

Executable Modal and Temporal Logics

inferredcites →https://doi.org/10.1007/3-540-58976-7_1openalex-snapshot

An introduction to executable modal and temporal logics

inferredcites →https://doi.org/10.1007/3-540-58976-7_2openalex-snapshot

Temporal logic programming with metric and past operators

inferredcites →https://doi.org/10.1007/3-540-58976-7_4openalex-snapshot

Temporal logic and annotated constraint logic programming

inferredcites →https://doi.org/10.1007/3-540-58976-7_5openalex-snapshot

Efficiently executable temporal logic programs

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/bf00245021openalex-snapshot

Temporal logic CTL + PROLOG

inferredcites →https://doi.org/10.1007/bfb0013075openalex-snapshot

From the past to the future: Executing temporal logic programs

inferredcites →https://doi.org/10.1007/bfb0014004openalex-snapshot

An overview of temporal and modal logic programming

inferredcites →https://doi.org/10.1007/bfb0014005openalex-snapshot

A survey of concurrent MetateM — The language and its applications

inferredcites →https://doi.org/10.1007/bfb0035790openalex-snapshot

On the synthesis of an asynchronous reactive module

inferredcites →https://doi.org/10.1016/0004-3702(84)90008-0openalex-snapshot

Towards a general theory of action and time

inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot

Using branching time temporal logic to synthesize synchronization skeletons

inferredcites →https://doi.org/10.1016/0743-1066(92)90055-8openalex-snapshot

Towards a unified theory of intensional logic programming

inferredcites →https://doi.org/10.1016/0743-1066(93)90016-aopenalex-snapshot

A Temporal extension of Prolog

inferredcites →https://doi.org/10.1016/s0747-7171(89)80070-7openalex-snapshot

Temporal logic programming

inferredcites →https://doi.org/10.1093/oso/9780198537755.003.0002openalex-snapshot

Theory and practice of tern poral logic programming

inferredcites →https://doi.org/10.1093/oso/9780198537755.003.0003openalex-snapshot

A simple proof of the completeness of ternporal logic programming

inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot

Synthesis of Communicating Processes from Temporal Logic Specifications

inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot

Constraint logic programming

inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot

On the synthesis of a reactive module

inferredcites →https://doi.org/10.1145/75277.75301openalex-snapshot

Temporal logic programming is complete and expressive

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119991472.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1007/1-84628-271-3openalex-snapshot

Agent Technology from a Formal Perspective

inferred← citeshttps://doi.org/10.1007/1-84628-271-3_5openalex-snapshot

Dynamic Team Formation in Executable Agent-Based Systems

inferred← citeshttps://doi.org/10.1007/10704567_18openalex-snapshot

An Operational Semantics of Starlog

inferred← citeshttps://doi.org/10.1007/11533092_16openalex-snapshot

Organising Software in Active Environments

inferred← citeshttps://doi.org/10.1007/11595014_53openalex-snapshot

Logical Implementation of Uncertain Agents

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-45634-1_11openalex-snapshot

Agents with Bounded Temporal Resources

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_13openalex-snapshot

Extending Timed Automaton and Real-Time Logic to Many-Valued Reasoning

inferred← citeshttps://doi.org/10.1007/3-540-49057-4_15openalex-snapshot

Representing Abstract Agent Architectures

inferred← citeshttps://doi.org/10.1007/3-540-63077-5_30openalex-snapshot

Distributed problem-solving as concurrent theorem proving

inferred← citeshttps://doi.org/10.1007/978-0-387-35261-9_30openalex-snapshot

Towards the Refinement of Executable Temporal Objects

inferred← citeshttps://doi.org/10.1007/978-0-387-89299-3_1openalex-snapshot

Executing Logical Agent Specifications

inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_9openalex-snapshot

Behavioral QLTL

inferred← citeshttps://doi.org/10.1007/978-3-319-00551-5_71openalex-snapshot

Application of Hybrid Agents to Smart Energy Management of a Prosumer Node

inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_5openalex-snapshot

Rule-Based Runtime Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_21openalex-snapshot

A Many-Valued Logic with Imperative Semantics for Incremental Specification of Timed Models

inferred← citeshttps://doi.org/10.1007/978-3-540-25932-9_12openalex-snapshot

Logic-Based Electronic Institutions

inferred← citeshttps://doi.org/10.1007/978-3-540-27834-4_35openalex-snapshot

An Agent-Based Approach to Web Site Maintenance

inferred← citeshttps://doi.org/10.1007/978-3-540-30200-1_2openalex-snapshot

Programming Groups of Rational Agents

inferred← citeshttps://doi.org/10.1007/978-3-540-45133-4_2openalex-snapshot

Organising Logic-Based Agents

inferred← citeshttps://doi.org/10.1007/978-3-540-77395-5_10openalex-snapshot

Rule Systems for Run-Time Monitoring: From Eagle to RuleR

inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_14openalex-snapshot

Temporal Verification of Probabilistic Multi-Agent Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-04686-5_9openalex-snapshot

A Logic Programming System for Evolving Programs with Temporal Operators

inferred← citeshttps://doi.org/10.1007/978-3-642-04694-0_1openalex-snapshot

Rule Systems for Runtime Verification: A Short Tutorial

inferred← citeshttps://doi.org/10.1007/978-3-642-34026-0_22openalex-snapshot

What Does AI Have to Do with RV?

inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_36openalex-snapshot

Prediction and Explanation over DL-Lite Data Streams

inferred← citeshttps://doi.org/10.1007/978-3-658-09994-7_6openalex-snapshot

Specification of Parametric Monitors

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-9586-5_19openalex-snapshot

Constructive Interval Temporal Logic in Alf

inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_21openalex-snapshot

Execution and Proof in a Horn-Clause Temporal Logic

inferred← citeshttps://doi.org/10.1007/978-94-017-1741-0_5openalex-snapshot

Coordinating Heterogeneous Components Using Executable Temporal Logic

inferred← citeshttps://doi.org/10.1007/s10009-014-0309-2openalex-snapshot

Rule-based runtime verification revisited

inferred← citeshttps://doi.org/10.1007/s10458-004-3140-4openalex-snapshot

Temporal Development Methods for Agent-Based

inferred← citeshttps://doi.org/10.1007/s10458-009-9105-xopenalex-snapshot

Executable specifications of resource-bounded agents

inferred← citeshttps://doi.org/10.1007/s10458-025-09712-wopenalex-snapshot

Behavioral QLTL

inferred← citeshttps://doi.org/10.1007/s10992-006-9041-zopenalex-snapshot

A Formal Characterisation of Hamblin’s Action-State Semantics

inferred← citeshttps://doi.org/10.1016/j.apal.2005.12.003openalex-snapshot

On complexity of verification of interacting agents’ behavior

inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.006openalex-snapshot

Bounded situation calculus action theories

inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.001openalex-snapshot

Operational semantics of Framed Tempura

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.007openalex-snapshot

Combining test case generation and runtime verification

inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00067-0openalex-snapshot

Incremental specification with SCTL/MUS-T: a case study

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00445-0openalex-snapshot

On feasible cases of checking multi-agent systems behavior

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/exn076openalex-snapshot

Rule Systems for Run-time Monitoring: from EAGLE to RULER

inferred← citeshttps://doi.org/10.1109/cmpsac.2002.1045078openalex-snapshot

Formalizing incremental design in real-time area: SCTL/MUS-T

inferred← citeshttps://doi.org/10.1109/ictai.2001.974454openalex-snapshot

Alma/Carne: implementation of a time-situated meta-reasoner

inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303336openalex-snapshot

Program monitoring with LTL in Eagle

inferred← citeshttps://doi.org/10.1109/tase.2007.4openalex-snapshot

A Logical Framework for Monitoring and Evolving Software Components

inferred← citeshttps://doi.org/10.1109/time.1997.600776openalex-snapshot

Automata representations for Concurrent METATEM

inferred← citeshttps://doi.org/10.1109/tnn.2011.2170180openalex-snapshot

Learning and Representing Temporal Knowledge in Recurrent Networks

inferred← citeshttps://doi.org/10.1111/j.1467-8640.2007.00295.xopenalex-snapshot

COMPUTATIONAL LOGICS AND AGENTS: A ROAD MAP OF CURRENT TECHNOLOGIES AND FUTURE TRENDS

inferred← citeshttps://doi.org/10.1134/s036176880905003xopenalex-snapshot

Systems of agents controlled by logical programs: Complexity of verification

inferred← citeshttps://doi.org/10.1145/545056.545130openalex-snapshot

Supporting nomadic agent-based applications in the FIPA agent architecture

inferred← citeshttps://doi.org/10.14236/ewic/fa1996.8openalex-snapshot

Towards Formal Methods for Agent-Based Systems

inferred← citeshttps://doi.org/10.2298/csis110214013bopenalex-snapshot

Software agents: Languages, tools, platforms

inferred← citeshttps://doi.org/10.29007/65ltopenalex-snapshot

Howard Barringer: the Man who Invented the Past

inferred← citeshttps://doi.org/10.29007/sz8jopenalex-snapshot

On and On the Temporal Way

inferred← citeshttps://doi.org/10.3103/s0146411611070169openalex-snapshot

Complexity of verification of nondeterministic probabilistic multiagent systems

inferred← citeshttps://doi.org/10.48550/arxiv.1509.02012openalex-snapshot

Bounded Situation Calculus Action Theories

inferred← citeshttps://doi.org/10.5282/ubm/epub.14881openalex-snapshot

State-of-the-art on evolution and reactivity

inferred← citeshttps://doi.org/10.5555/2484920.2485208openalex-snapshot

Self-checking logical agents

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.