Balbiani, Philippe and Tinchev, Tinko
Unification in modal logic Alt1.
(2016)
In: 11th conference on Advances in Modal logic (AiML 2016), 30 August 2016 - 2 September 2016 (Budapest, Hungary).
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 380kB |
Official URL: http://www.aiml.net/volumes/volume11/Balbiani-Tinchev.pdf
Abstract
ALT1 is the least modal logic containing the formula characterizing deterministic frames. The unification problem in ALT1 is to determine, given a formula A(x1,...,xn), whether there exists formulas B1, ..., Bn such that A(B1,...,Bn) is in ALT1. In this paper, we show that the unification problem in ALT1 is in PSPACE. We also show that there exists an ALT1-unifiable formula that has no minimal complete set of unifiers. Finally, we study sub-Boolean variants of the unification problem in ALT1.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Additional Information: | This papers appears in volume 11 of Advances in Modal Logic ISBN : 978-1-84890-201-5 The original PDF of the article can be found at: http://www.aiml.net/volumes/volume11/Balbiani-Tinchev.pdf |
HAL Id: | hal-01650177 |
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: | |
Statistics: | download |
Deposited On: | 20 Nov 2017 13:29 |
Repository Staff Only: item control page