Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Jaroslav Bendík"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the exact timi
Externí odkaz:
https://doaj.org/article/a7c5269593584d0ea26578acff2a2dfc
Autor:
Jaroslav Bendík, Kuldeep S. Meel
Publikováno v:
Formal Methods in System Design.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d67c9f2e4688e0123bc6e74a03ccffcf
https://doi.org/10.1007/s10703-023-00419-w
https://doi.org/10.1007/s10703-023-00419-w
Autor:
Jaroslav Bendík, Kuldeep S. Meel
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:3651-3660
Given an unsatisfiable set of constraints F, a maximal satisfiable subset (MSS) is a maximal subset of constraints C ⊆ F such that C is satisfiable. Over the past two decades, the steady improvement in runtime performance of algorithms for finding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fd31cf231d3c4cb1232b0660c068554
https://doi.org/10.1609/aaai.v35i5.16481
https://doi.org/10.1609/aaai.v35i5.16481
Autor:
Jaroslav Bendík, Kuldeep S. Meel
Publikováno v:
Computer Aided Verification ISBN: 9783030816872
CAV (2)
CAV (2)
Given an unsatisfiable Boolean formulaFin CNF, an unsatisfiable subset of clauses U ofFis called Minimal Unsatisfiable Subset (MUS) if every proper subset ofUis satisfiable. Since MUSes serve as explanations for the unsatisfiability ofF, MUSes find a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05ec3c9ade7d44e5e126a99e37a5d678
https://doi.org/10.1007/978-3-030-81688-9_15
https://doi.org/10.1007/978-3-030-81688-9_15
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
LPAR
Given an unsatisfiable Boolean Formula F in CNF, i.e., a set of clauses, one is often interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the complements of MSSes called Minimal Correction Subsets (MCSes). Since MSSes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ce754bcc727e452a475b74ca6b1184a
https://doi.org/10.29007/8btb
https://doi.org/10.29007/8btb
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
TACAS (1)
In many areas of computer science, we are given an unsatisfiable set of constraints with the goal to provide an insight into the unsatisfiability. One of common approaches is to identify minimal unsatisfiable subsets (MUSes) of the constraint set. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3d1cc811fa748162a6cc112fb28b3be
https://doi.org/10.1007/978-3-030-45190-5_8
https://doi.org/10.1007/978-3-030-45190-5_8
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030584740
CP
CP
In many areas of computer science, we are given an unsatisfiable Boolean formula F in CNF, i.e. a set of clauses, with the goal to identify minimal unsatisfiable subsets (MUSes) of F. The more MUSes are identified, the better insight into F’s unsat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8d22fcdaf4224962fe330c0be65c1b8
https://doi.org/10.1007/978-3-030-58475-7_3
https://doi.org/10.1007/978-3-030-58475-7_3
Autor:
Kuldeep S. Meel, Jaroslav Bendík
Publikováno v:
Computer Aided Verification ISBN: 9783030532871
CAV (1)
CAV (1)
Given an unsatisfiable formula F in CNF, i.e. a set of clauses, the problem of Minimal Unsatisfiable Subset (MUS) seeks to identify a minimal subset of clauses \(N \subseteq F\) such that N is unsatisfiable. The emerging viewpoint of MUSes as the roo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47d29ca11ba7b23c65531ac6612ac7f5
https://doi.org/10.1007/978-3-030-53288-8_21
https://doi.org/10.1007/978-3-030-53288-8_21
Publikováno v:
Automated Technology for Verification and Analysis-16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
In various areas of computer science, we deal with a set of constraints to be satisfied. If the constraints cannot be satisfied simultaneously, it is desirable to identify the core problems among them. Such cores are called minimal unsatisfiable subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4a2d9aba97a0000e54085381220ea08