chapter

Modal and temporal logics

Author:

Colin StirlingAuthors Info & Claims

Handbook of logic in computer science (vol. 2): background: computational structures

March 1993

Pages 477 - 563

Published: 18 March 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Davies R(2017)A Temporal Logic Approach to Binding-Time AnalysisJournal of the ACM10.1145/301106964:1(1-45)Online publication date: 24-Mar-2017
https://dl.acm.org/doi/10.1145/3011069
Balbiani PLorini E(2013)Ockhamist Propositional Dynamic LogicProceedings of the 20th International Workshop on Logic, Language, Information, and Computation - Volume 807110.1007/978-3-642-39992-3_22(251-265)Online publication date: 20-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-39992-3_22
Ognjanović ZPerović ADoder D(2013)A first-order dynamic probability logicProceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty10.1007/978-3-642-39091-3_39(461-472)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39091-3_39
Show More Cited By

Index Terms

Modal and temporal logics
1. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness
  2. Logic

Recommendations

Labelled Sequent Calculi for Inquisitive Modal Logics
Logic, Language, Information, and Computation
Abstract
We present cut-free labelled sequent calculi for various systems of inquisitive modal logic, including inquisitive epistemic logic and inquisitive doxastic logic. Inquisitive modal logic extends the framework of standard modal logic with a ...
Reified Temporal Logics: An Overview

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal ...
Kripke Semantics for Modal Substructural Logics

We introduce Kripke semantics for modal substructural logics, and prove the completeness theorems with respect to the semantics. The completeness theorems are proved using an extended Ishihara's method of canonical model construction (Ishihara, 2000). The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Handbook of logic in computer science (vol. 2): background: computational structures

March 1993

571 pages

ISBN:0198537611

Editors:
S. Abramsky
Imperial College of Science, Technology and Medicine
,
Dov M. Gabbay
Imperial College of Science, Technology and Medicine
,
S. E. Maibaum
Imperial College of Science, Technology and Medicine

Publisher

Oxford University Press, Inc.

United States

Publication History

Published: 18 March 1993

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Davies R(2017)A Temporal Logic Approach to Binding-Time AnalysisJournal of the ACM10.1145/301106964:1(1-45)Online publication date: 24-Mar-2017
https://dl.acm.org/doi/10.1145/3011069
Balbiani PLorini E(2013)Ockhamist Propositional Dynamic LogicProceedings of the 20th International Workshop on Logic, Language, Information, and Computation - Volume 807110.1007/978-3-642-39992-3_22(251-265)Online publication date: 20-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-39992-3_22
Ognjanović ZPerović ADoder D(2013)A first-order dynamic probability logicProceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty10.1007/978-3-642-39091-3_39(461-472)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39091-3_39
Ognjanović ZMarković ZRašković MDoder DPerović A(2012)A propositional probabilistic logic with discrete linear time for reasoning about evidenceAnnals of Mathematics and Artificial Intelligence10.1007/s10472-012-9307-965:2-3(217-243)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1007/s10472-012-9307-9
Ognjanović ZDoder DMarković Z(2011)A branching time logic with two types of probability operatorsProceedings of the 5th international conference on Scalable uncertainty management10.5555/2050266.2050288(219-232)Online publication date: 10-Oct-2011
https://dl.acm.org/doi/10.5555/2050266.2050288
Costa-Soria CHeckel R(2009)Modelling the asynchronous dynamic evolution of architectural typesProceedings of the First international conference on Self-organizing architectures10.5555/1880569.1880582(198-229)Online publication date: 14-Sep-2009
https://dl.acm.org/doi/10.5555/1880569.1880582
Hierons RBogdanov KBowen JCleaveland RDerrick JDick JGheorghe MHarman MKapoor KKrause PLüttgen GSimons AVilkomir SWoodward MZedan H(2009)Using formal specifications to support testingACM Computing Surveys10.1145/1459352.145935441:2(1-76)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1459352.1459354
Pérez JAli NCarsı JRamos IÁlvarez BSanchez PPastor J(2008)Integrating aspects in software architecturesInformation and Software Technology10.1016/j.infsof.2007.08.00750:9-10(969-990)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1016/j.infsof.2007.08.007
Brázdil TForejt VKučera A(2008)Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time ObjectivesProceedings of the 35th international colloquium on Automata, Languages and Programming, Part II10.1007/978-3-540-70583-3_13(148-159)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70583-3_13
Alur R(2008)Model Checking25 Years of Model Checking10.1007/978-3-540-69850-0_6(89-106)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1007/978-3-540-69850-0_6
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Labelled Sequent Calculi for Inquisitive Modal Logics

Reified Temporal Logics: An Overview

Kripke Semantics for Modal Substructural Logics

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations