- 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
Other Versions
No versions found
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
Review: H. van Ditmarsch, W. van der Hoek and B. Kooi’s Dynamic Epistemic Logic. [REVIEW]Patrick Girard - 2009 - Australasian Journal of Logic 7:26-31.
Graded modalities in epistemic logic* W. Van der hoek.J. -J. Ch Meyer - 1991 - Logique Et Analyse 133:251.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18).Jérôme Lang (ed.) - 2018
J.-J. Ch. Meyer and W. Van Der Hoek. Epistemic logic for AI and computer science. Cambridge tracts in theoretical computer science, no. 41. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1995, xiii + 354 pp. [REVIEW]Rineke Verbrugge - 1999 - Journal of Symbolic Logic 64 (4):1837-1840.
Analytics
Added to PP
2012-01-12
Downloads
31 (#810,329)
6 months
8 (#521,441)
2012-01-12
Downloads
31 (#810,329)
6 months
8 (#521,441)
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.
On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae.Petar Iliev - forthcoming - Logic Journal of the IGPL.
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.
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-54b44b69b7-72j75 uwo