OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Axiomatization and Computability of a Variant of Iteration-Free PDL with Fork

Balbiani, Philippe and Boudou, Joseph Axiomatization and Computability of a Variant of Iteration-Free PDL with Fork. (2018) In: First International Workshop Dynamic Logic. New Trends and Applications (DALI 2017), 23 September 2017 - 24 September 2017 (Brasilia, Brazil).

[img]
Preview
(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
425kB

Official URL: https://doi.org/10.1007/978-3-319-73579-5_2

Abstract

We devote this paper to the axiomatization and the computability of PDLΔ0—a variant of iteration-free PDL with fork.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Thanks to Springer editor. This papers appears in Volume 10669 of Lecture Notes in Computer Science ISSN : 0302-9743 ISBN: 978-3-319-73579-5 The original PDF is available at: https://link.springer.com/chapter/10.1007/978-3-319-73579-5_2
HAL Id:hal-02365624
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:
Statistics:download
Deposited On:08 Nov 2019 13:27

Repository Staff Only: item control page