A tableau calculus with automaton-labelled formulae for regular grammar logics
| dc.contributor.author | Gore, Rajeev | |
| dc.contributor.author | Nguyen, Linh Anh | |
| dc.coverage.spatial | Koblenz Germany | |
| dc.date.accessioned | 2015-12-13T22:57:45Z | |
| dc.date.available | 2015-12-13T22:57:45Z | |
| dc.date.created | September 14-17 2005 | |
| dc.date.issued | 2005 | |
| dc.date.updated | 2015-12-12T07:18:34Z | |
| dc.description.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. | |
| dc.identifier.isbn | 3540289313 | |
| dc.identifier.uri | http://hdl.handle.net/1885/83126 | |
| dc.publisher | Springer | |
| dc.relation.ispartofseries | International Conference on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 2005) | |
| dc.source | Proceedings of TABLEAUX 2005 | |
| dc.subject | Keywords: Automata theory; Decision making; Differentiation (calculus); Automaton-labelled formulae; Craig interpolation lemma; Regular grammar logics; Formal logic | |
| dc.title | A tableau calculus with automaton-labelled formulae for regular grammar logics | |
| dc.type | Conference paper | |
| local.bibliographicCitation.lastpage | 152 | |
| local.bibliographicCitation.startpage | 138 | |
| local.contributor.affiliation | Gore, Rajeev, College of Engineering and Computer Science, ANU | |
| local.contributor.affiliation | Nguyen, Linh Anh, University of Warsaw | |
| local.contributor.authoruid | Gore, Rajeev, u9409448 | |
| local.description.notes | Imported from ARIES | |
| local.description.refereed | Yes | |
| local.identifier.absfor | 080203 - Computational Logic and Formal Languages | |
| local.identifier.absfor | 080201 - Analysis of Algorithms and Complexity | |
| local.identifier.ariespublication | MigratedxPub11335 | |
| local.identifier.scopusID | 2-s2.0-33646184790 | |
| local.type.status | Published Version |