Counting for satisfiability by inverting resolution

DOI10.1007/S10462-004-4329-2MaRDI QIDQ2386352zbMATH OpenOpenAlexFDO

Authors Ştefan Andrei

Publication date 22 August 2005

Published in Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10462-004-4329-2

zbMATH Keywords

algorithmssatisfiabilitycounting truth assignments

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2090009
• scientific article; zbMATH DE number 6117305
• New worst-case upper bound for counting exact satisfiability
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 2084758

Cites work

• scientific article; zbMATH DE number 1696785 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 54155 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1315584 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1462097 (Why is no real title available?)
• scientific article; zbMATH DE number 1737608 (Why is no real title available?)
• scientific article; zbMATH DE number 2089957 (Why is no real title available?)
• scientific article; zbMATH DE number 784360 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Graph-Theoretic Approach for Timing Analysis and its Implementation
• A Machine-Oriented Logic Based on the Resolution Principle
• A dual algorithm for the satisfiability problem
• Algorithms for testing satisfiability formulas
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• Counting propositional models
• Counting the number of solutions for instances of satisfiability
• Inductive Logic Programming: Theory and methods
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Number of models and satisfiability of sets of clauses
• The Complexity of Enumeration and Reliability Problems
• The complexity of computing the permanent
• The complexity of theorem-proving procedures
• The efficiency of resolution and Davis-Putnam procedures

Cited in

(3)

• A rigorous methodology for specification and verification of business processes
• Resolution with counting: dag-like lower bounds and different moduli
• scientific article; zbMATH DE number 7650367 (Why is no real title available?)

This page was built for publication: Counting for satisfiability by inverting resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386352)