LIPIcs.CSL.2013.28.pdf
- Filesize: 234 kB
- 2 pages
Document
Means and Limits of Decision (Invited Talk)
Author
-
Part of:
Volume:
Computer Science Logic 2013 (CSL 2013)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-09-02
Cite AsGet BibTex
Lidia Tendera. Means and Limits of Decision (Invited Talk). In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 28-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.CSL.2013.28
https://doi.org/10.4230/LIPIcs.CSL.2013.28
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.
Keywords
- classical decision problem
- decidability
- computational complexity
- two-variable first-order logic
- guarded logic
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads