文章基本信息

标题：Means and Limits of Decision (Invited Talk)
本地全文：下载
作者：Lidia Tendera
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2013
卷号：23
页码：28-29
DOI：10.4230/LIPIcs.CSL.2013.28
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：classical decision problem; decidability; computational complexity; two-variable first-order logic; guarded logic