Cited By
View all- Belardinelli FLomuscio A(2009)Quantified epistemic logics for reasoning about knowledge in multi-agent systemsArtificial Intelligence10.1016/j.artint.2009.02.003173:9-10(982-1013)Online publication date: 1-Jun-2009
A temporal epistemic logic with a reset operation
Article No.: 145, Pages 1 - 8
Abstract
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic "reset" operator defined on the intersection between epistemic and temporal relations. Additionally we show the logic has the finite model property, hence it is decidable.
References
[1]
P. Balbiani and L. Fariñas del Cerro. Complete axiomatization of a relative modal logic with composition and intersection. Journal of Applied Non-Classical Logics, (8):325--335, 1998.
[2]
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proceedings of TACAS' 99, volume 1579 of LNCS, pages 193--207. Springer--Verlag, 1999.
[3]
E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons for branching-time temporal logic. In Proceedings of Workshop on Logic of Programs, volume 131 of LNCS, pages 52--71. Springer-Verlag, 1981.
[4]
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, 1999.
[5]
E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30(1):1--24, 1985.
[6]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.
[7]
R. Fagin, J. Y. Halpern, and M. Y. Vardi. What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM, 39(2):328--376, 1992.
[8]
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, 1979.
[9]
P. Gammie and R. van der Meyden. MCK: Model checking the logic of knowledge. In Proceedings of CAV'04, volume 3114 of LNCS, pages 479--483. Springer-Verlag, 2004.
[10]
J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319--379, 1992.
[11]
J. Hintikka. Knowledge and Belief, An Introduction to the Logic of the Two Notions. Cornell University Press, Ithaca (NY) and London, 1962.
[12]
W. van der Hoek. Systems for knowledge and belief. Journal of Logic and Computation, 3(2):173--195, 1993.
[13]
W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proceedings of SPIN'02. 2002.
[14]
A. Lomuscio and F. Raimondi. MCMAS: A model checker for multiagent systems. In Proceedings of TACAS' 06, volume 3920, pages 450--454. Springer Verlag, 2006.
[15]
A. Lomuscio and M. Ryan. On the relation between interpreted systems and Kripke models. In Volume 1441 of LNAI. Springer Verlag, 1998.
[16]
A. Lomuscio and M. Sergot. Deontic interpreted systems. Studia Logica, 75(1):63--92, 2003.
[17]
A. Lomuscio and B. Woźzna. A complete and decidable axiomatisation for deontic interpreted systems. In Proceedings of DEON'06, volume 4048, pages 238--254. Springer Berlin / Heidelberg, 2006.
[18]
R. van der Meyden and K. Wong. Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica, 75(1):93--123, 2003.
[19]
W. Penczek and A. Lomuscio. Verifying epistemic properties of multiagent systems via bounded model checking. Fundamenta Informaticae, 55(2):167--185, 2003.
[20]
F. Raimondi and A. Lomuscio. Automatic verification of multiagent systems by model checking via OBDDs. Journal of Applied Logic, 2007. To appear.
[21]
B. Woźna, A. Lomuscio, and W. Penczek. Bounded model checking for knowledge over real time. In Proceedings of AAMAS'05, volume I, pages 165--172. ACM Press, 2005.
Index Terms
- A temporal epistemic logic with a reset operation
Recommendations
First-Order Intuitionistic Epistemic Logic
Logic, Rationality, and InteractionAbstractIntuitionistic epistemic logic (IEL), introduced by Artemov and Protopopescu (2016), accepts the co-reflection axiom: “” in terms of Brouwer-Heyting-Kolmogorov interpretation. There are two variants for IEL, one of which has the axiom “”, while ...
A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic
AbstractIntuitionistic epistemic logic by Artemov and Protopopescu (Rev Symb Log 9:266–298, 2016) accepts the axiom “if A, then A is known” (written ) in terms of the Brouwer–Heyting–Kolmogorov interpretation. There are two variants of intuitionistic ...
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
Logical Foundations of Computer ScienceAbstractArtemov and Protopopescu proposed intuitionistic epistemic logic (IEL) to capture an intuitionistic conception of knowledge. By establishing completeness, they provided the base for a meta-theoretic investigation of IEL, which was continued by ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2007
1585 pages
ISBN:9788190426275
DOI:10.1145/1329125
- Conference Chairs:
- Edmund Durfee,
- Makoto Yokoo,
- Program Chairs:
- Michael Huhns,
- Onn Shehory
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- IFAAMAS
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 May 2007
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
AAMAS07
Sponsor:
AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems
May 14 - 18, 2007
Hawaii, Honolulu
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 123Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
Cited By
View all- Belardinelli FLomuscio A(2009)Quantified epistemic logics for reasoning about knowledge in multi-agent systemsArtificial Intelligence10.1016/j.artint.2009.02.003173:9-10(982-1013)Online publication date: 1-Jun-2009
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.
Sign in