共 50 条
- [12] Second-Order Quantified Boolean Logic THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 4, 2023, : 4007 - 4015
- [13] Satisfiability in Boolean Logic (SAT problem) is polynomial JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS, 2021, 14 (05): : 667 - 671
- [14] SOLVING QUERIES BY TREE PROJECTIONS ACM TRANSACTIONS ON DATABASE SYSTEMS, 1993, 18 (03): : 487 - 511
- [15] Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1339 - 1345
- [16] FPGA logic synthesis using Quantified Boolean Satisfiability THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 444 - 450
- [17] Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 2748 - 2754
- [18] A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 3697 - 3706
- [19] Consistent Answers of Aggregation Queries via SAT 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 924 - 937