Search results
- 1.0583783 - ÚI 2024 RIV CH eng C - Conference Paper (international conference)
Haniková, Zuzana - Manya, F. - Vidal, A.
The MaxSAT Problem in the Real-Valued MV-Algebra.
Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2023 Proceedings. Cham: Springer, 2023 - (Ramanayake, R.; Urban, J.), s. 386-404. Lecture Notes in Computer Science, 14278. ISBN 978-3-031-43512-6. ISSN 0302-9743.
[TABLEAUX 2023: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods /32./. Prague (CZ), 18.09.2024-21.09.2024]
Grant - others:AV ČR(CZ) CSIC-20-12
Program: Bilaterální spolupráce
Institutional support: RVO:67985807
Keywords : Maximum satisfiability * Satisfiability * Łukasiewicz logic * MV-algebra
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007/978-3-031-43513-3_21
Permanent Link: https://hdl.handle.net/11104/0351788File Download Size Commentary Version Access 0583783-aoa.pdf 2 379.5 KB OA CC BY 4.0 Publisher’s postprint open-access - 2.0570721 - ÚI 2024 RIV CH eng C - Conference Paper (international conference)
Kolárik, T. - Ratschan, Stefan
Railway Scheduling Using Boolean Satisfiability Modulo Simulations.
Formal Methods: 25th International Symposium, FM 2023, Lübeck, Germany, March 6–10, 2023, Proceedings. Cham: Springer, 2023 - (Chechik, M.; Katoen, J.; Leucker, M.), s. 56-73. Lecture Notes in Computer Science, 14000. ISBN 978-3-031-27480-0. ISSN 0302-9743.
[FM 2023: International Symposium on Formal Methods /25./. Lübeck (DE), 06.03.2023-10.03.2023]
R&D Projects: GA ČR(CZ) GA21-09458S
Institutional support: RVO:67985807
Keywords : planning * scheduling * Boolean satisfiability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://dx.doi.org/10.1007/978-3-031-27481-7_5
Permanent Link: https://hdl.handle.net/11104/0342060 - 3.0536433 - ÚI 2021 RIV US eng J - Journal Article
Kučera, P. - Savický, Petr
Bounds on the Size of PC and URC Formulas.
Journal of Artificial Intelligence Research. Roč. 69, 24 December (2020), s. 1395-1420. ISSN 1076-9757. E-ISSN 1943-5037
R&D Projects: GA ČR(CZ) GA19-19463S
Institutional support: RVO:67985807
Keywords : automated reasoning * knowledge representation * satisfiability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 2.776, year: 2020
Method of publishing: Open access
Permanent Link: http://hdl.handle.net/11104/0314210File Download Size Commentary Version Access 0536433-afin.pdf 2 294.1 KB OA casopis Publisher’s postprint open-access - 4.0536431 - ÚI 2022 RIV US eng C - Conference Paper (international conference)
Kučera, P. - Savický, Petr
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.
Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI Press, 2021, s. 3832-3840. ISBN 978-1-57735-866-4.
[AAAI 2021. Conference on Artificial Intelligence /35./. Vancouver / Online (CA), 02.02.2021-09.02.2021]
R&D Projects: GA ČR(CZ) GA19-19463S
Institutional support: RVO:67985807
Keywords : Satisfiability * Knowledge Representation Languages
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://ojs.aaai.org/index.php/AAAI/article/view/16501
Permanent Link: http://hdl.handle.net/11104/0314209File Download Size Commentary Version Access aaai2021.JPG 0 106.2 KB Other require 0536431-aoa.pdf 4 149.9 KB Publisher’s postprint require - 5.0531242 - ÚI 2021 RIV CH eng C - Conference Paper (international conference)
Kolárik, T. - Ratschan, Stefan
SAT Modulo Differential Equation Simulations.
Tests and Proofs. Cham: Springer, 2020 - (Ahrendt, W.; Wehrheim, H.), s. 80-99. Lecture Notes on Computer Science, 12165. ISBN 978-3-030-50994-1. ISSN 0302-9743.
[TAP 2020: The International Conference on Tests and Proofs /14./. Bergen (NO), 22.06.2020-23.06.2020]
Institutional support: RVO:67985807
Keywords : constraint solving * Boolean satisfiability * formal verification
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0309940 - 6.0476160 - MÚ 2018 RIV US eng J - Journal Article
de Oliveira Oliveira, Mateus
On the satisfiability of quantum circuits of small treewidth.
Theory of Computing Systems. Roč. 61, č. 2 (2017), s. 656-688. ISSN 1432-4350. E-ISSN 1433-0490
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : treewidth * satisfiability of quantum circuits * tensor networks * Merlin-Arthur protocols
OECD category: Pure mathematics
Impact factor: 0.458, year: 2017
https://link.springer.com/article/10.1007%2Fs00224-016-9727-8
Permanent Link: http://hdl.handle.net/11104/0272693File Download Size Commentary Version Access DeOliveiraOliveira.pdf 2 847.8 KB Publisher’s postprint require - 7.0453988 - MÚ 2016 RIV CH eng C - Conference Paper (international conference)
de Oliveira Oliveira, Mateus
On the satisfiability of quantum circuits of small treewidth.
Computer Science - Theory and Applications. Cham: Springer, 2015 - (Beklemishev, L.; Musatov, D.), s. 157-172. Lecture Notes in Computer Science, 9139. ISBN 978-3-319-20296-9. ISSN 0302-9743.
[International Computer Science Symposium in Russia, CSR 2015. Listvyanka (RU), 13.07.2015-17.07.2015]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : treewidth * satisfiability of quantum circuits * tensor networks
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-319-20297-6_11
Permanent Link: http://hdl.handle.net/11104/0254711File Download Size Commentary Version Access Oliveira.pdf 2 324 KB Publisher’s postprint require - 8.0439177 - ÚI 2017 RIV NL eng J - Journal Article
Haniková, Zuzana - Savický, Petr
Term Satisfiability in FLew-Algebras.
Theoretical Computer Science. Roč. 631, 6 June (2016), s. 1-15. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : substructural logic * FLew-algebra * MV-algebra * satisfiability * computational complexity
OECD category: Pure mathematics
Impact factor: 0.698, year: 2016
Permanent Link: http://hdl.handle.net/11104/0242470File Download Size Commentary Version Access a0439177.pdf 8 496.2 KB Publisher’s postprint require - 9.0439176 - ÚI 2015 US eng V - Research Report
Haniková, Zuzana - Savický, Petr
Term satisfiability in FLew-algebras.
Cornell University, 2015. 24 s. arXiv.org e-Print archive, arXiv:1501.02250 [cs.LO].
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : substructural logic * FLew-algebra * MV-algebra * satisfiability * computational complexity
Subject RIV: BA - General Mathematics
http://arxiv.org/abs/1501.02250
Permanent Link: http://hdl.handle.net/11104/0242467 - 10.0431690 - ÚI 2015 AT eng A - Abstract
Haniková, Zuzana - Savický, Petr
On satisfiability of terms in FLew-algebras.
Abstract Booklet - LATD 2014. Vienna: Vienna University of Technology, 2014 - (Baaz, M.; Ciabattoni, A.; Hetzl, S.). s. 191-193
[LATD 2014. Logic, Algebra and Truth Degrees. 16.07.2014-19.07.2014, Vienna]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : substructural logic * Full Lambek calculus with exchange and weakening * satisfiability of terms
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0236274File Download Size Commentary Version Access a0431690.pdf 0 431.1 KB Publisher’s postprint open-access