Balbiani, Philippe and Tinchev, Tinko
Definability and computability for PRSPDL.
(2014)
In: 10th conference on Advances in Modal logic (AiML 2014), 1 January 2014 - 31 December 2014 (Groningen, Netherlands).
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 331kB |
Official URL: http://www.aiml.net/volumes/volume10/Balbiani-Tinchev.pdf
Abstract
PRSPDL is a variant of PDL with parallel composition. In the Kripke models in which PRSPDL-formulas are evaluated, states have an internal structure. We devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computability issue of PRSPDL-validity for various fragments of the PRSPDL-language and for various classes of PRSPDL-frames.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Additional Information: | This papers appears in volume 10 of Advances in Modal Logic ISBN : 978-1-84890-151-3The original PDF of the article can be found at: http://www.aiml.net/volumes/volume10/Balbiani-Tinchev.pdf |
HAL Id: | hal-01650181 |
Audience (conference): | International conference proceedings |
Uncontrolled Keywords: | |
Institution: | French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE) Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE) Other partners > Sofia University St. Kliment Ohridski (BULGARIA) 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: | ANR-11-BS02-011 - DID02/32/2009 - ANR-11-LABX-0040- CIMI within the program ANR-11-IDEX-0002-02 |
Statistics: | download |
Deposited On: | 20 Nov 2017 15:36 |
Repository Staff Only: item control page