Sciweavers

330 search results - page 1 / 66
» Algorithms for Propositional Model Counting
Sort
View
LPAR
2007
Springer
13 years 11 months ago
Algorithms for Propositional Model Counting
Marko Samer, Stefan Szeider
SAT
2005
Springer
145views Hardware» more  SAT 2005»
13 years 10 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
ICTAI
2005
IEEE
13 years 10 months ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...
LPAR
2010
Springer
13 years 2 months ago
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
Javier Larrosa, Albert Oliveras, Enric Rodrí...
AAAI
2006
13 years 6 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...