2026-07-21T14:16:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4187 2024-03-06T10:34:51Z ddc:004 open_access

Means and Limits of Decision (Invited Talk) Tendera, Lidia classical decision problem decidability computational complexity two-variable first-order logic guarded logic 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lidia Tendera 2013 Is Part Of LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2013.28 urn:nbn:de:0030-drops-41870 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.28 eng https://creativecommons.org/licenses/by/3.0/legalcode