On the succinctness of some modal logics
Authors:
- Tim FrenchTFTim French
- Wiebe van der HoekWHWiebe van der Hoek
- Petar IlievPIPetar Iliev
- Barteld KooiBKBarteld Kooi
- 1 April 2013
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 197, 56-85
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Foundations of instance level updates in expressive description logicsArtificial Intelligence, 2011
- Complexity and succinctness of public announcement logic2006
- The succinctness of first-order logic on linear ordersLogical Methods in Computer Science, 2005
- Comparing the succinctness of monadic query languages over finite treesRAIRO - Theoretical Informatics and Applications, 2004
- An n ! lower bound on formula sizeACM Transactions on Computational Logic, 2003
- Temporal logic with forgettable past2002
- Modal Logic and the Two-Variable Fragment2001
- Succinctness Gap between Monadic Logic and Duration CalculusFundamenta Informaticae, 2000
- The size of a revised knowledge baseArtificial Intelligence, 1999
- Modal Environment for Boolean Speculations1987