Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Martina Seidl"'
Publikováno v:
Discrete Mathematics Letters, Vol 2, Pp 47-51 (2019)
Externí odkaz:
https://doaj.org/article/dcfe253b0e8a495b96d03fddeb6e843e
Autor:
Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 229, Iss Proc. SYNT 2016, Pp 149-177 (2016)
We report on the benchmarks, participants and results of the third reactive synthesis competition(SYNTCOMP 2016). The benchmark library of SYNTCOMP 2016 has been extended to benchmarks in the new LTL-based temporal logic synthesis format (TLSF), and
Externí odkaz:
https://doaj.org/article/aaccd15b40d741e083b82d2c6cd3e043
Autor:
Swen Jacobs, Roderick Bloem, Romain Brenguier, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 202, Iss Proc. SYNT 2015, Pp 27-57 (2016)
We report on the design and results of the second reactive synthesis competition (SYNTCOMP 2015). We describe our extended benchmark library, with 6 completely new sets of benchmarks, and additional challenging instances for 4 of the benchmark sets t
Externí odkaz:
https://doaj.org/article/a9c45a590c8c4abeb527d9ec981ba822
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 4 (2018)
Clause-elimination procedures that simplify formulas in conjunctive normal form play an important role in modern SAT solving. Before or during the actual solving process, such procedures identify and remove clauses that are irrelevant to the solving
Externí odkaz:
https://doaj.org/article/051649b49eab4027b9e518c0167889bc
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308222
Over the last years, innovative parallel and distributed SAT solving techniques were presented that could impressively exploit the power of modern hardware and cloud systems. Two approaches were particularly successful: (1) search-space splitting in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2501566121e07eb44348a98b3895a8b8
https://doi.org/10.1007/978-3-031-30823-9_22
https://doi.org/10.1007/978-3-031-30823-9_22
Publikováno v:
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b80161dfcddbf0d661af116cf00217f1
https://doi.org/10.1109/synasc57785.2022.00022
https://doi.org/10.1109/synasc57785.2022.00022
Autor:
Martina Seidl
Publikováno v:
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1f95a864a350b83f6e6bce6acda8800
https://doi.org/10.1109/synasc57785.2022.00012
https://doi.org/10.1109/synasc57785.2022.00012
Autor:
Florian Lonsing, Roderick Bloem, Nicolas Braud-Santoni, Uwe Egly, Martina Seidl, Vedad Hadzic
Publikováno v:
Formal Methods in System Design. 57:157-177
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44315d0a7d3e8270416272ac172935c8
https://doi.org/10.1007/s10703-021-00371-7
https://doi.org/10.1007/s10703-021-00371-7
Publikováno v:
Journal of Symbolic Computation. 104:899-916
It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 × 3 -matrices. For non-commutative coefficient rings, it is not known whether it can also be done with fewer multiplications. However, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::185c5945d1ba7597d64242b7638630ef
https://doi.org/10.1016/j.jsc.2020.10.003
https://doi.org/10.1016/j.jsc.2020.10.003
Publikováno v:
ACM Transactions on Computational Logic. 22:1-46
This article deals with advanced notions of equivalence between nonmonotonic logic programs under the answer-set semantics, a topic of considerable interest, because such notions form the basis for program verification and are useful for program opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f479e3d5a4be4496476756089f6d67d1
https://doi.org/10.1145/3422361
https://doi.org/10.1145/3422361