QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Automated deduction for many-valued logics
Handbook of automated reasoning
Resolution decision procedures
Handbook of automated reasoning
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Translation of resolution proofs into short first-order proofs without choice axioms
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
The axiomatic translation principle for modal logic
ACM Transactions on Computational Logic (TOCL)
Extended resolution simulates binary decision diagrams
Discrete Applied Mathematics
Binary resolution over complete residuated Stone lattices
Fuzzy Sets and Systems
A solver for QBFs in negation normal form
Constraints
A Solver for QBFs in Nonprenex Form
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Translation of resolution proofs into short first-order proofs without choice axioms
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Faster SAT solving with better CNF generation
Proceedings of the Conference on Design, Automation and Test in Europe
A modularity approach for a fragment of ALC
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Clause form conversions for boolean circuits
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Computing tiny clause normal forms
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Minimizing models for tseitin-encoded SAT instances
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |