Stökkva yfir í aðalyfirlit Stökkva yfir í leit Stökkva yfir í aðalefni

Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes

  • Aggeliki Chalki

Rannsóknarafurð: Kafli í bók/skýrslu/ráðstefnuritiRáðstefnuframlagritrýni

Útdráttur

We present quantitative logics with two-step semantics based on the framework of quantitative logics introduced by Arenas et al. (2020) and the two-step semantics defined in the context of weighted logics by Gastin & Monmege (2018). We show that some of the fragments of our logics augmented with a least fixed point operator capture interesting classes of counting problems. Specifically, we answer an open question in the area of descriptive complexity of counting problems by providing logical characterisations of two subclasses of #P, namely SpanL and TotP, that play a significant role in the study of approximable counting problems. Moreover, we define logics that capture FPSPACE and SpanPSPACE, which are counting versions of PSPACE.

Upprunalegt tungumálEnska
Titill gistiútgáfu48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
RitstjórarJerome Leroux, Sylvain Lombardy, David Peleg
ÚtgefandiSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN-númer (rafrænt)9783959772921
DOI
ÚtgáfustaðaÚtgefið - 21 ágú. 2023
Viðburður48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023 - Bordeaux, Frakkland
Tímalengd: 28 ágú. 20231 sep. 2023

Ritröð

NafnLeibniz International Proceedings in Informatics, LIPIcs
Bindi272

Ráðstefna

Ráðstefna48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
Land/YfirráðasvæðiFrakkland
Borg/bærBordeaux
Tímabil28/08/231/09/23

Athugasemd

Publisher Copyright: © Antonis Achilleos and Aggeliki Chalki;

Fingerprint

Sökktu þér í rannsóknarefni „Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes“. Saman myndar þetta einstakt fingrafar.

Vitna í þetta