Counting for satisfiability by inverting resolution

DOI10.1007/S10462-004-4329-2zbMATH Open1099.68098OpenAlexW1519524620MaRDI QIDQ2386352FDOQ2386352

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

Recommendations

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

zbMATH Keywords

algorithmssatisfiabilitycounting truth assignments

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• The complexity of theorem-proving procedures
• Title not available (Why is that?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Inductive Logic Programming: Theory and methods
• Title not available (Why is that?)
• The efficiency of resolution and Davis-Putnam procedures
• Title not available (Why is that?)
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• Counting the number of solutions for instances of satisfiability
• Number of models and satisfiability of sets of clauses
• A dual algorithm for the satisfiability problem
• A Graph-Theoretic Approach for Timing Analysis and its Implementation
• Counting propositional models
• Algorithms for testing satisfiability formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Resolution with counting: dag-like lower bounds and different moduli
• A rigorous methodology for specification and verification of business processes
• Title not available (Why is that?)

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)