Balbiani, Philippe
and Boudou, Joseph
Tableaux methods for propositional dynamic logics with separating parallel composition.
(2015)
In: International Conference on Automated Deduction (CADE 2015), 1 August 2015 - 7 August 2015 (Berlin, Germany).
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 884kB |
Official URL: https://doi.org/10.1007/978-3-319-21401-6_37
Abstract
PRSPDL is a propositional dynamic logic with an operator for parallel compositions of programs. We first give a complexity upper bound for this logic. Then we focus on the class of ⊲-deterministic frames and give tableaux methods for two fragments of PRSPDL over this class of frames.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Thanks to Springer editor. This papers appears in Volume 9195 of Lecture Notes in Computer Science ISSN : 0302-9743 ISBN: 978-3-319-21400-9 The original PDF is available at: https://link.springer.com/chapter/10.1007/978-3-319-21401-6_37 |
| HAL Id: | hal-01650183 |
| Audience (conference): | International conference proceedings |
| Uncontrolled Keywords: | |
| Institution: | Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE) French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE) Université de Toulouse > Université Toulouse III - Paul Sabatier - UT3 (FRANCE) Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE) Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE) |
| Laboratory name: | |
| Funders: | French National Research Agency : DynRes / ANR-11-BS02-011 |
| Statistics: | download |
| Deposited On: | 21 Nov 2017 10:37 |
Repository Staff Only: item control page
