共 50 条
- [21] Solving Queries for Boolean Fault Tree Logic via Quantified SAT PROCEEDINGS OF THE 9TH ACM SIGPLAN INTERNATIONAL WORKSHOP ON FORMAL TECHNIQUES FOR SAFETY-CRITICAL SYSTEMS, FTSCS 2023, 2023, : 48 - 59
- [22] Conflict driven learning in a quantified Boolean satisfiability solver IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 442 - 449
- [23] HPC-based parallel software for solving applied Boolean satisfiability problems 2020 43RD INTERNATIONAL CONVENTION ON INFORMATION, COMMUNICATION AND ELECTRONIC TECHNOLOGY (MIPRO 2020), 2020, : 1006 - 1011
- [24] Clause/term resolution and learning in the evaluation of Quantified Boolean Formulas JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 26 : 371 - 416
- [25] Clause/term resolution and learning in the evaluation of quantified boolean formulas Journal of Artificial Intelligence Research, 2006, 26 : 371 - 416
- [26] A symbolic search based approach for quantified Boolean formulas THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 16 - 30
- [27] Multiplication Complexity Optimization based on Quantified Boolean Formulas 2024 INTERNATIONAL SYMPOSIUM OF ELECTRONICS DESIGN AUTOMATION, ISEDA 2024, 2024, : 332 - 336
- [28] SAT based BDD solver for Quantified Boolean Formulas ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 82 - 89
- [30] Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations Formal Methods in System Design, 2021, 57 : 157 - 177