Detail publikačního výsledku

Automata Terms in a Lazy WSkS Decision Procedure

HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T.

Originální název

Automata Terms in a Lazy WSkS Decision Procedure

Anglický název

Automata Terms in a Lazy WSkS Decision Procedure

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

We propose a lazy decision procedure for the logic WSkS. It builds a term-based symbolic representation of the state space of the tree automaton (TA) constructed by the classical WSkS decision procedure. The classical decision procedure transforms the symbolic representation into a TA via a bottom-up traversal and then tests its language non-emptiness, which corresponds to satisfiability of the formula. On the other hand, we start evaluating the representation from the top, construct the state space on the fly, and utilize opportunities to prune away parts of the state space irrelevant to the language emptiness test. In order to do so, we needed to extend the notion of language terms (denoting language derivatives) used in our previous procedure for the linear fragment of the logic (the so-called WS1S) into automata terms. We implemented our decision procedure and identified classes of formulae on which our prototype implementation is significantly faster than the classical procedure implemented in the Mona tool.

Anglický abstrakt

We propose a lazy decision procedure for the logic WSkS. It builds a term-based symbolic representation of the state space of the tree automaton (TA) constructed by the classical WSkS decision procedure. The classical decision procedure transforms the symbolic representation into a TA via a bottom-up traversal and then tests its language non-emptiness, which corresponds to satisfiability of the formula. On the other hand, we start evaluating the representation from the top, construct the state space on the fly, and utilize opportunities to prune away parts of the state space irrelevant to the language emptiness test. In order to do so, we needed to extend the notion of language terms (denoting language derivatives) used in our previous procedure for the linear fragment of the logic (the so-called WS1S) into automata terms. We implemented our decision procedure and identified classes of formulae on which our prototype implementation is significantly faster than the classical procedure implemented in the Mona tool.

Klíčová slova

WSkS, weak second-order logic, tree automata, lazy evaluation

Klíčová slova v angličtině

WSkS, weak second-order logic, tree automata, lazy evaluation

Autoři

HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T.

Rok RIV

2020

Vydáno

30.08.2019

Nakladatel

Springer Verlag

Místo

Natal

Kniha

Proceedings of 27th International Conference on Automated Deduction (CADE-27)

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Svazek

11716

Číslo

11716

Stát

Spolková republika Německo

Strany od

300

Strany do

318

Strany počet

19

URL

BibTex

@inproceedings{BUT159972,
  author="Vojtěch {Havlena} and Lukáš {Holík} and Ondřej {Lengál} and Tomáš {Vojnar}",
  title="Automata Terms in a Lazy WSkS Decision Procedure",
  booktitle="Proceedings of 27th International Conference on Automated Deduction (CADE-27)",
  year="2019",
  journal="Lecture Notes in Computer Science",
  volume="11716",
  number="11716",
  pages="300--318",
  publisher="Springer Verlag",
  address="Natal",
  doi="10.1007/978-3-030-29436-6\{_}18",
  issn="0302-9743",
  url="https://www.fit.vut.cz/research/publication/11973/"
}

Dokumenty