Foundations of logic programming
Foundations of logic programming
Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Safety analysis of timing properties in real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
CNF satisfiability test by counting and polynomial average time
SIAM Journal on Computing
Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
A dual algorithm for the satisfiability problem
Information Processing Letters
Information Processing Letters
Interactive theory revision: an inductive logic programming approach
Interactive theory revision: an inductive logic programming approach
On the hardness of approximate reasoning
Artificial Intelligence
Number of models and satisfiability of sets of clauses
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
Algorithms for Testing Satisfiability Formulas
Artificial Intelligence Review
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
(2+ f(n))-SAT and Its Properties
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Real-Time Systems: Scheduling, Analysis, and Verification
Real-Time Systems: Scheduling, Analysis, and Verification
On some central problems in computational complexity.
On some central problems in computational complexity.
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We present a new algorithm for counting truth assignments of a clausal formula using inverse propositional resolution and its associated normalization rules. The idea is opposite of the classical resolution, and is achieved by constructing in a bottom-up manner a computation graph. This means that we successively add complementary literals to generate new bigger clauses instead of solving them. Next, we make a comparison between the classical and inverse resolution, followed by a new algorithm which combines these two techniques for solving the SAT problem.