| Abstract |
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also give an effective Craig interpolation lemma for regular grammar logics using our calculus.
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| Options |
Mark as duplicate
Export citation
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 53,742
External links
(no proxy) Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Only published works are available at libraries.
References found in this work BETA
Modal Tableau Calculi and Interpolation.Wolfgang Rautenberg - 1983 - Journal of Philosophical Logic 12 (4):403 - 423.
An Overview of Tableau Algorithms for Description Logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD.Linh Anh Nguyen - 2001 - Studia Logica 69 (1):41-57.
Citations of this work BETA
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.Linh Anh Nguyen & Andrzej Szałas - 2011 - Studia Logica 98 (3):387-428.
Modal Logics for Reasoning About Infinite Unions and Intersections of Binary Relations.Natasha Alechina, Philippe Balbiani & Dmitry Shkatov - 2012 - Journal of Applied Non-Classical Logics 22 (4):275 - 294.
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures.Alwen Tiu, Egor Ianovski & Rajeev Goré - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 516-537.
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics.Linh Nguyen - 2008 - Logic Journal of the IGPL 16 (2):175-193.
Similar books and articles
On Superintuitionistic Logics as Fragments of Proof Logic Extensions.A. V. Kuznetsov & A. Yu Muravitsky - 1986 - Studia Logica 45 (1):77 - 99.
Deciding Regular Grammar Logics with Converse Through First-Order Logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD.Linh Anh Nguyen - 2001 - Studia Logica 69 (1):41-57.
Simultaneous Rigid Sorted Unification for Tableaux.P. J. Martín & A. Gavilanes - 2002 - Studia Logica 72 (1):31-59.
A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most.Riccardo Rosati - 2001 - Studia Logica 69 (1):171-191.
An Overview of Tableau Algorithms for Description Logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.Linh Anh Nguyen & Andrzej Szałas - 2011 - Studia Logica 98 (3):387-428.
Analytics
Added to PP index
2010-05-07
Total views
24 ( #416,366 of 2,349,843 )
Recent downloads (6 months)
1 ( #511,368 of 2,349,843 )
2010-05-07
Total views
24 ( #416,366 of 2,349,843 )
Recent downloads (6 months)
1 ( #511,368 of 2,349,843 )
How can I increase my downloads?
Downloads
