License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.28
URN: urn:nbn:de:0030-drops-41870
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4187/
Tendera, Lidia
Means and Limits of Decision (Invited Talk)
Abstract
In this talk we survey recent work in the quest for expressive logics with good algorithmic properties, starting from the two-variable fragment of first-order logic and the guarded fragment. While tracing the boundary between decidable and undecidable fragments we describe their power, limitations, similarities and differences in order to stress out key properties responsible for their good or bad behaviour. We also highlight tools and techniques that have proven most effective for designing optimal algorithms, special attention giving to the more universal ones.
BibTeX - Entry
@InProceedings{tendera:LIPIcs:2013:4187,
author = {Lidia Tendera},
title = {{Means and Limits of Decision (Invited Talk)}},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
pages = {28--29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-60-6},
ISSN = {1868-8969},
year = {2013},
volume = {23},
editor = {Simona Ronchi Della Rocca},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4187},
URN = {urn:nbn:de:0030-drops-41870},
doi = {10.4230/LIPIcs.CSL.2013.28},
annote = {Keywords: classical decision problem, decidability, computational complexity, two-variable first-order logic, guarded logic}
}
|
Keywords: |
|
classical decision problem, decidability, computational complexity, two-variable first-order logic, guarded logic |
|
Collection: |
|
Computer Science Logic 2013 (CSL 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
02.09.2013 |
