[PDF][PDF] Canonical models and the complexity of modal team logic
M Lück - Logical Methods in Computer Science, 2019 - lmcs.episciences.org
We study modal team logic MTL, the team-semantical extension of modal logic ML closed
under Boolean negation. Its fragments, such as modal dependence, independence, and …
under Boolean negation. Its fragments, such as modal dependence, independence, and …
[PDF][PDF] Is satisfiability of quantified bit-vector formulas stable under bit-width changes
M Jonáš, J Strejček - LPAR-22. 22nd International Conference on …, 2018 - easychair.org
In general, deciding satisfiability of quantified bit-vector formulas becomes harder with
increasing maximal allowed bit-width of variables and constants. However, this does not …
increasing maximal allowed bit-width of variables and constants. However, this does not …
[PDF][PDF] How Hard is Bit-Precise Reasoning?
G Kovásznai - Proc. of the 10th International Conference on …, 2017 - researchgate.net
Formal verification of hardware and software is important in the case of critical systems, as
shown by several accidents due to such problems as overflow, rounding error, etc. Bit …
shown by several accidents due to such problems as overflow, rounding error, etc. Bit …
[PDF][PDF] Computational Complexity and Solving Approaches for Bit-Vector Reasoning
G Kovásznai - researchgate.net
I would like to thank to my parents for supporting me in several ways and, in particular, in
becoming a computer scientist. Thanks for buying me my first computer, a Videoton TV …
becoming a computer scientist. Thanks for buying me my first computer, a Videoton TV …
[引用][C] On the Complexity of Modal Team Logic and Two-Variable Team Logic.
M Lück - arXiv preprint arXiv:1709.05253, 2017