Zobrazeno 1 - 10
of 31
pro vyhledávání: '"A Goultiaeva"'
Autor:
Alexandra Goultiaeva, Fahiem Bacchus
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 24:71-76
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The technique of cube learning has been developed to help them prune satisfying
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94ccdee3642f488458f45bd73d1047a2
https://doi.org/10.1609/aaai.v24i1.7548
https://doi.org/10.1609/aaai.v24i1.7548
Autor:
Goultiaeva, Alexandra
Deciding the truth of a Quantified Boolean Formula (QBF) is a canonical PSPACE-complete problem. It provides a powerful framework for encoding problems that lie in PSPACE. These include many problems in automatic verification, and problems with discr
Externí odkaz:
http://hdl.handle.net/1807/44111
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6bb8fc9949fe6473ce51da516a3f4fc
https://doi.org/10.7873/date.2013.172
https://doi.org/10.7873/date.2013.172
Autor:
Fahiem Bacchus, Alexandra Goultiaeva
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2013 ISBN: 9783642390708
SAT
SAT
Quantified Boolean Formula (QBF) solvers that utilize non-CNF representations are able to reason dually about conflicts and solutions by accessing structural information contained in the non-CNF representation. This structure is not as easily accesse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fd34495572055d17a1f45b45adb3daa
https://doi.org/10.1007/978-3-642-39071-5_8
https://doi.org/10.1007/978-3-642-39071-5_8
Autor:
Alexandra Goultiaeva, Fahiem Bacchus
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2012 ISBN: 9783642316111
SAT
SAT
Most state of the art SAT solvers for industrial problems are based on the Conflict Driven Clause Learning (CDCL) paradigm. Although this paradigm evolved from the systematic DPLL search algorithm, modern techniques of far backtracking and restarts m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba63865379a65dbe41962bd29fd73c3e
https://doi.org/10.1007/978-3-642-31612-8_4
https://doi.org/10.1007/978-3-642-31612-8_4
Publikováno v:
2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::277f50499329b9ad25f0a89f24a57fa2
https://doi.org/10.1109/date.2010.5457088
https://doi.org/10.1109/date.2010.5457088
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642027765
SAT
SAT
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Normal Form (CNF) in representing the QBF formula. Although CNF has worked we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92247048a0d9ce5289141c0e9d6358c8
https://doi.org/10.1007/978-3-642-02777-2_38
https://doi.org/10.1007/978-3-642-02777-2_38
Publikováno v:
Molecular genetics and genomics : MGG. 281(6)
While the breeding system known as distyly has been used as a model system in genetics, and evolutionary biology for over a century, the genes determining this system remain unknown. To positionally clone genes determining distyly, a high-resolution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e26f52aa4fbf4fb2be54e30f911f0777
https://pubmed.ncbi.nlm.nih.gov/19283410
https://pubmed.ncbi.nlm.nih.gov/19283410
Publikováno v:
Proceedings of the Conference: Design, Automation & Test in Europe; 3/18/2013, p811-814, 4p
Publikováno v:
Proceedings of the Conference: Design, Automation & Test in Europe; 3/8/2010, p1695-1700, 6p