Nested Antichains for WS1S

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU135013" target="_blank" >RIV/00216305:26230/19:PU135013 - isvavai.cz</a>

Result on the web

<a href="https://www.fit.vut.cz/research/publication/11889/" target="_blank" >https://www.fit.vut.cz/research/publication/11889/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00236-018-0331-z" target="_blank" >10.1007/s00236-018-0331-z</a>

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 generalization of the one used by the so-called antichain algorithms for handling nondeterministic automata. We have obtained encouraging experimental results, in some cases outperforming Mona, and some of the other recently proposed approaches, by several orders of magnitude.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

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)

Publication year

2019

Confidentiality

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

Name of the periodical

Acta Informatica

ISSN

0001-5903

e-ISSN

1432-0525

Volume of the periodical

56

Issue of the periodical within the volume

3

Country of publishing house

DE - GERMANY

Number of pages

24

Pages from-to

205-228

UT code for WoS article

000461763400001

EID of the result in the Scopus database

2-s2.0-85059334544