On the public citation graph
An overview of temporal and modal logic programming
0 signed · 148 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-15648-8_1openalex-snapshot
Nonclausal temporal deduction
inferredcites →https://doi.org/10.1007/3-540-15670-4_6openalex-snapshot
Executing temporal logic programs
inferredcites →https://doi.org/10.1007/3-540-16479-0_14openalex-snapshot
Implementation of temporal logic programming language Tokio
inferredcites →https://doi.org/10.1007/3-540-16479-0_24openalex-snapshot
Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis
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/3-540-56282-6_2openalex-snapshot
Metaprogramming through intensional deduction: Some examples
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/978-3-642-76799-9openalex-snapshot
Logic, Algebra, and Computation
inferredcites →https://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf03037381openalex-snapshot
MOLOG: A system that extends PROLOG with modal logic
inferredcites →https://doi.org/10.1007/bfb0012852openalex-snapshot
A resolution calculus for modal logics
inferredcites →https://doi.org/10.1007/bfb0013529openalex-snapshot
Nonclassical models for logic programs
inferredcites →https://doi.org/10.1007/bfb0013544openalex-snapshot
Tim: The toulouse inference machine for non-classical logic programming
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/0020-0190(93)90014-zopenalex-snapshot
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
inferredcites →https://doi.org/10.1016/0165-0114(90)90117-oopenalex-snapshot
Non-standard logics for automated reasoning
inferredcites →https://doi.org/10.1016/0167-739x(91)90006-jopenalex-snapshot
DIALOG — A dataflow model for parallel execution of logic programs
inferredcites →https://doi.org/10.1016/0168-0072(94)90011-6openalex-snapshot
Linear logic as a logic of computations
inferredcites →https://doi.org/10.1016/0304-3975(86)90157-xopenalex-snapshot
Concerning the semantic consequence relation in first-order temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(89)90126-6openalex-snapshot
Paraconsistent logic programming
inferredcites →https://doi.org/10.1016/0304-3975(89)90129-1openalex-snapshot
Semantics of distributed definite clause programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90138-2openalex-snapshot
The power of temporal proofs
inferredcites →https://doi.org/10.1016/0304-3975(92)90290-vopenalex-snapshot
Multimodal logic programming using equational and order-sorted logic
inferredcites →https://doi.org/10.1016/0743-1066(85)90005-6openalex-snapshot
Top-down semantics of fair computations of logic programs
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/0743-1066(92)90045-5openalex-snapshot
Proving termination properties of prolog programs: A semantic approach
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/b978-0-934613-32-3.50025-3openalex-snapshot
TOWARD A TENSE-LOGIC-BASED MITIGATION OF THE FRAME PROBLEM
inferredcites →https://doi.org/10.1016/s0747-7171(89)80070-7openalex-snapshot
Temporal logic programming
inferredcites →https://doi.org/10.1093/logcom/2.3.247openalex-snapshot
Modal Theorem Proving: An Equational Viewpoint
inferredcites →https://doi.org/10.1093/logcom/4.6.877openalex-snapshot
Extending Temporal Logic Programming with Choice Predicates Non-determinism
inferredcites →https://doi.org/10.1093/oso/9780198537755.001.0001openalex-snapshot
Intensional Logics for Programming
inferredcites →https://doi.org/10.1093/oso/9780198537755.003.0001openalex-snapshot
Monotone 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.1093/oso/9780198537755.003.0004openalex-snapshot
Metalevel features 1n the object level: modal and temporal logic programming III
inferredcites →https://doi.org/10.1109/icci.1993.315313openalex-snapshot
Chronolog(Z): linear-time logic programming
inferredcites →https://doi.org/10.1109/lics.1988.5130openalex-snapshot
Fully abstract denotational semantics for flat Concurrent Prolog
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1137/0205029openalex-snapshot
Lucid—A Formal System for Writing and Proving Programs
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/308386.308416openalex-snapshot
Temporal deductive databases and infinite objects
inferredcites →https://doi.org/10.1145/319983.319986openalex-snapshot
Formal semantics for time in databases
inferredcites →https://doi.org/10.1145/320764.320765openalex-snapshot
The Association for Computing Machinery
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferredcites →https://doi.org/10.1145/75277.75301openalex-snapshot
Temporal logic programming is complete and expressive
inferredcites →https://doi.org/10.11575/prism/30561openalex-snapshot
UPDATES IN A TEMPORAL LOGIC PROGRAMMING LANGUAGE
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
inferredcites →https://doi.org/10.2307/412917openalex-snapshot
Formal philosophy: selected papers of Richard Montague. Edited and with an introduction by Richmond H. Thomason. New Haven: Yale University Press, 1974. Pp. 368. $12.50.
inferredcites →https://doi.org/10.3233/fi-1988-11206openalex-snapshot
Logic Programming on a Topological Bilattice1
inferredcites →https://doi.org/10.7551/mitpress/1425.003.0027openalex-snapshot
Guarded Horn Clause Languages: Are They Deductive and Logical?
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.0063openalex-snapshot
Editorial: Executable Temporal Logics
inferred← citeshttps://doi.org/10.1006/jsco.1996.0066openalex-snapshot
Temporal Annotated Constraint Logic Programming
inferred← citeshttps://doi.org/10.1006/jsco.1996.0068openalex-snapshot
Executable Temporal Logic for Non-monotonic Reasoning
inferred← citeshttps://doi.org/10.1006/jsco.1996.0072openalex-snapshot
Dealing with Multiple Granularity of Time in Temporal Logic Programming
inferred← citeshttps://doi.org/10.1007/10704567_18openalex-snapshot
An Operational Semantics of Starlog
inferred← citeshttps://doi.org/10.1007/11415763_7openalex-snapshot
Deductive and Inductive Reasoning on Spatio-Temporal Data
inferred← citeshttps://doi.org/10.1007/11750734_3openalex-snapshot
Reasoning About Epistemic States of Agents by Modal Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_18openalex-snapshot
Spatio-temporal Annotated Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45508-6_23openalex-snapshot
A Framework for Event Correlation in Communication Systems
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_1openalex-snapshot
MuTACLP: A Language for Temporal Reasoning with Multiple Theories
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_13openalex-snapshot
A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results
inferred← citeshttps://doi.org/10.1007/978-1-4020-2867-0_1openalex-snapshot
An Introduction to Formal Methods
inferred← citeshttps://doi.org/10.1007/978-1-4419-1452-1_18openalex-snapshot
Cognitive Algorithms and Systems: Reasoning and Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_42openalex-snapshot
MProlog: An Extension of Prolog for Modal Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-73954-8_11openalex-snapshot
Advances in Neural-Symbolic Learning Systems: Modal and Temporal Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-00675-3_11openalex-snapshot
Integrating Temporal Annotations in a Modular Logic Language
inferred← citeshttps://doi.org/10.1007/978-3-642-34002-4_47openalex-snapshot
Knowlog: A Declarative Language for Reasoning about Knowledge in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_2openalex-snapshot
Normal Multimodal Logics with Interaction Axioms
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_9openalex-snapshot
Semantics for Temporal Annotated Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-981-92-0184-6_2openalex-snapshot
Demonic Dynamic Logic Programming
inferred← citeshttps://doi.org/10.1007/bf03037535openalex-snapshot
Temporal disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bfb0035645openalex-snapshot
Cactus: A branching-time logic programming language
inferred← citeshttps://doi.org/10.1007/s004500050043openalex-snapshot
Temporales logisches Programmieren
inferred← citeshttps://doi.org/10.1007/s10458-010-9138-1openalex-snapshot
Declarative programming for agent applications
inferred← citeshttps://doi.org/10.1007/s11245-006-9005-5openalex-snapshot
Abductive reasoning in neural-symbolic systems
inferred← citeshttps://doi.org/10.1007/s11786-008-0048-4openalex-snapshot
Knowledge Representation, Reasoning and Integration Using Temporal Logic with Clocks
inferred← citeshttps://doi.org/10.1007/s11786-008-0049-3openalex-snapshot
Querying Historical Data Over Multiple Time-Lines
inferred← citeshttps://doi.org/10.1016/b978-0-12-817463-0.00005-8openalex-snapshot
Formal verification of robotic cell injection systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100632openalex-snapshot
Semantics of temporal constrained objects
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.05.014openalex-snapshot
Temporal stratification tests for linear and branching-time deductive databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.026openalex-snapshot
Multimodal logic programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.023openalex-snapshot
Connectionist modal logic: Representing modalities in neural networks
inferred← citeshttps://doi.org/10.1016/s0096-0551(98)00009-5openalex-snapshot
Branching-time logic programming: the language Cactus and its applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00048-0openalex-snapshot
Multi-dimensional logic programming: theoretical foundations
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00139-4openalex-snapshot
Programming in metric temporal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80348-7openalex-snapshot
Timed Term Rewrite Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03012-xopenalex-snapshot
Chapter 12 Temporal Representation and Reasoning
inferred← citeshttps://doi.org/10.1023/a:1012502800961openalex-snapshot
The Branching-Time Transformation Technique for Chain Datalog Programs
inferred← citeshttps://doi.org/10.1023/a:1012551818243openalex-snapshot
The Logical Approach to Temporal Reasoning
inferred← citeshttps://doi.org/10.1080/00207169508804444openalex-snapshot
Foundations of linear-time logic programming
inferred← citeshttps://doi.org/10.1080/11663081.2018.1427987openalex-snapshot
Temporal Equilibrium Logic with past operators
inferred← citeshttps://doi.org/10.1109/cmpsac.1997.625024openalex-snapshot
Formal Methods For The Re-Engineering of Computing Systems
inferred← citeshttps://doi.org/10.1109/dexa.1999.795234openalex-snapshot
Temporal annotated constraint logic programming with multiple theories
inferred← citeshttps://doi.org/10.1109/honet.2015.7395420openalex-snapshot
Formal analysis of a ZigBee-based routing protocol for smart grids using UPPAAL
inferred← citeshttps://doi.org/10.1109/icapp.1995.472181openalex-snapshot
A framework for exploiting parallelism in Chronolog
inferred← citeshttps://doi.org/10.1109/iconip.2002.1199022openalex-snapshot
A connectionist inductive learning system for modal logic programming
inferred← citeshttps://doi.org/10.1109/icpc.2006.10openalex-snapshot
An Approach to High-Level Behavioral Program Documentation Allowing Lightweight Verification
inferred← citeshttps://doi.org/10.1109/iri.2006.252422openalex-snapshot
Representation and Integration of Knowledge based on Multiple Granularity of Time using Temporal Logic
inferred← citeshttps://doi.org/10.1109/maes.2009.5256385openalex-snapshot
Distributed contextual data fusion with ACIPL
inferred← citeshttps://doi.org/10.1109/naecon.2008.4806568openalex-snapshot
Distributed Contextual Data Fusion with ACIPL
inferred← citeshttps://doi.org/10.1109/skg.2006.99openalex-snapshot
Specifying Dynamic Security Properties of Web Service Based Systems
inferred← citeshttps://doi.org/10.1109/systems.2008.4519010openalex-snapshot
Dynamic Theories of Trust for Secure Agent-Based Systems
inferred← citeshttps://doi.org/10.1109/taes.2020.2966902openalex-snapshot
Automatic Scheduling for Earth Observation Satellite With Temporal Specifications
inferred← citeshttps://doi.org/10.1109/tai.1997.632229openalex-snapshot
W-ACE: a logic language for intelligent Internet programming
inferred← citeshttps://doi.org/10.1109/time.2002.1027467openalex-snapshot
On the operational semantics of timed rewrite systems
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1996.tb00261.xopenalex-snapshot
ON TEMPORAL DEDUCTIVE DATABASES
inferred← citeshttps://doi.org/10.1145/2528931openalex-snapshot
Logical foundations for more expressive declarative temporal logic programming languages
inferred← citeshttps://doi.org/10.1145/3109481openalex-snapshot
A Survey of Naturalistic Programming Technologies
inferred← citeshttps://doi.org/10.1145/331119.331415openalex-snapshot
Executing specifications of distributed computations with Chronolog(MC)
inferred← citeshttps://doi.org/10.1145/349194.349197openalex-snapshot
Temporal logics for real-time system specification
inferred← citeshttps://doi.org/10.1145/571157.571171openalex-snapshot
Transforming the .NET intermediate language using path logic programming
inferred← citeshttps://doi.org/10.1145/571157.571172openalex-snapshot
A generic operator over discrete time intervals
inferred← citeshttps://doi.org/10.1162/neco.2006.18.7.1711openalex-snapshot
A Connectionist Computational Model for Epistemic and Temporal Reasoning
inferred← citeshttps://doi.org/10.14279/depositonce-315openalex-snapshot
Modeling Spatial and Temporal Data in an Object-Oriented Constraint Database Framework
inferred← citeshttps://doi.org/10.14569/ijarai.2012.010704openalex-snapshot
Temporally Annotated Extended Logic Programs
inferred← citeshttps://doi.org/10.18653/v1/p19-1618openalex-snapshot
NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language
inferred← citeshttps://doi.org/10.24963/kr.2023/66openalex-snapshot
Computing All Facts Entailed By An LTL Specification
inferred← citeshttps://doi.org/10.3103/s0147688210060067openalex-snapshot
Temporal nonmonotonic logical systems: Interrelationships and computational complexity
inferred← citeshttps://doi.org/10.3166/jancl.19.167-181openalex-snapshot
Modal logic programming revisited
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-621openalex-snapshot
Imprecise Probabilistic Horn Clause Logic
inferred← citeshttps://doi.org/10.33899/rengj.2023.136476.01208openalex-snapshot
The Influence of Temporal Logic on Finite Automata
inferred← citeshttps://doi.org/10.4018/978-1-6684-3666-0.ch042openalex-snapshot
Formal Verification of ZigBee-Based Routing Protocol for Smart Grids
inferred← citeshttps://doi.org/10.4018/978-1-7998-3479-3.ch069openalex-snapshot
Formal Verification of ZigBee-Based Routing Protocol for Smart Grids
inferred← citeshttps://doi.org/10.4230/dagsemproc.08041.5openalex-snapshot
The Grand Challenges and Myths of Neural-Symbolic Computation
inferred← citeshttps://doi.org/10.54223/uniwitwatersrand-10539-32846openalex-snapshot
Debunking the Myth of the Fourth Industrial Revolution
inferred← citeshttps://doi.org/10.5445/ir/273796openalex-snapshot
Modeling problem-solving methods in new KARL
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.