共 50 条
- [1] Reduction theorems for boolean formulas using Δ-trees [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, 2000, 1919 : 179 - 192
- [3] The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits [J]. Theory of Computing Systems, 2017, 61 : 263 - 282
- [4] Algorithms for Testing Satisfiability Formulas [J]. Artificial Intelligence Review, 2001, 15 : 153 - 163
- [5] Algorithms for testing satisfiability formulas [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2001, 15 (03) : 153 - 163
- [6] Representing Boolean formulas by using trees of implicants and implicates [J]. PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : 551 - 554
- [7] ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL FORMULAS [J]. JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (01): : 45 - 61
- [10] Testing the Satisfiability of Formulas in Separation Logic with Permissions [J]. AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2023, 2023, 14278 : 427 - 445