OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Decidability and complexity via mosaics of the temporal logic of the lexicographic products of unbounded dense linear orders

Balbiani, Philippe and Mikulás, Szabolcs Decidability and complexity via mosaics of the temporal logic of the lexicographic products of unbounded dense linear orders. (2013) In: 9th International Symposium Frontiers of Combining Systems (FroCoS), 18 September 2013 - 20 September 2013 (Nancy, France).

[img]
Preview
(Document in English)

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

Official URL: http://dx.doi.org/10.1007/978-3-642-40885-4_10

Abstract

This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a complete decision procedure in nondeterministic polynomial time for the satisfiability problem it gives rise to.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Thanks to Springer editor. This papers appears in Volume 8152 Lecture Notes in Computer Science ISSN : 0302-9743 ISBN: 978-3-642-40884-7 The original PDF is available at : http://link.springer.com/chapter/10.1007%2F978-3-642-40885-4_10
Audience (conference):National conference proceedings
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Université de Toulouse > Institut National Polytechnique de Toulouse - INPT (FRANCE)
Université de Toulouse > Université Toulouse III - Paul Sabatier - UPS (FRANCE)
Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE)
Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE)
Other partners > University of London (UNITED KINGDOM)
Laboratory name:
Statistics:download
Deposited By: IRIT IRIT
Deposited On:08 Jul 2015 08:45

Repository Staff Only: item control page