All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Nested Antichains for WS1S

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU116949" target="_blank" >RIV/00216305:26230/15:PU116949 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-662-46681-0_59" target="_blank" >http://dx.doi.org/10.1007/978-3-662-46681-0_59</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-662-46681-0_59" target="_blank" >10.1007/978-3-662-46681-0_59</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Nested Antichains for WS1S

  • Original language description

    We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented, e.g., in MONA. The way in which the standard decision procedure processes quantifiers involves determinization, with its worst case exponential complexity, for every quantifier alternation in the prefix of a formula. Our algorithm avoids building the deterministic automata-instead, it constructs only those of their states needed for (dis)proving validity of the formula. It uses a symbolic representation of the states, which have a deeply nested structure stemming from the repeated implicit subset construction, and prunes the search space by a nested subsumption relation, a generalisation of the one used by the so-called antichain algorithms for handling non-deterministic automata. We have obtained encouraging experimental results, in some cases outperforming MONA by several orders of magnitude.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of TACAS'15

  • ISBN

    978-3-662-46680-3

  • ISSN

  • e-ISSN

  • Number of pages

    17

  • Pages from-to

    658-674

  • Publisher name

    Springer Verlag

  • Place of publication

    Heidelberg

  • Event location

    London

  • Event date

    Apr 11, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article