- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Succinctness of Epistemic Languages
Abstract
Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo ParkAuthor Profiles
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Reasoning about local properties in modal logic.Wiebe van der Hoek, Hans van Ditmarsch & Barteld Kooi - unknown
Everything is Knowable – How to Get to Know Whether a Proposition is True.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2012 - Theoria 78 (2):93-114.
Probabilistic dynamic epistemic logic.Barteld P. Kooi - 2003 - Journal of Logic, Language and Information 12 (4):381-408.
Nonmonotonic reasoning, Grigoris Antoniou.Wiebe van der Hoek - 2000 - Journal of Logic, Language and Information 9 (1):125-128.
Generalized quantifiers and modal logic.Wiebe Van Der Hoek & Maarten De Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
Logic and the Foundations of Game and Decision Theory.Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.) - 2008 - Amsterdam University Press.
Comparing semantics of logics for multi-agent systems.Valentin Goranko & Wojciech Jamroga - 2004 - Synthese 139 (2):241 - 280.
Analytics
Added to PP
2012-01-12
Downloads
21 (#695,936)
6 months
5 (#544,079)
2012-01-12
Downloads
21 (#695,936)
6 months
5 (#544,079)
Historical graph of downloads
Author Profiles
Citations of this work
Reasoning About Agent Types and the Hardest Logic Puzzle Ever.Fenrong Liu & Yanjing Wang - 2013 - Minds and Machines 23 (1):123-161.
Relation-changing modal operators: Fig. 1.Carlos Areces, Raul Fervari & Guillaume Hoffmann - 2015 - Logic Journal of the IGPL 23 (4):601-627.
Frame-validity Games and Lower Bounds on the Complexity of Modal Axioms.Philippe Balbiani, David Fernández-Duque, Andreas Herzig & Petar Iliev - 2022 - Logic Journal of the IGPL 30 (1):155-185.
Public announcements, public assignments and the complexity of their logic.Hans van Ditmarsch, Andreas Herzig & Tiago De Lima - 2012 - Journal of Applied Non-Classical Logics 22 (3):249-273.
Dynamic epistemic logics: promises, problems, shortcomings, and perspectives.Andreas Herzig - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):328-341.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-pp8v9 uwo