42 search results - page 3 / 9 » Algorithms for computing backbones of propositional formulae |
127
Voted
SAT
2005
Springer
15 years 9 months ago
2005
Springer
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...
133
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
In a peer-to-peer inference system, there is no centralized control or hierarchical organization: each peer is equivalent in functionality and cooperates with other peers in order...
109
Voted
FMCAD
2007
Springer
15 years 9 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
126
Voted
ICTAI
1997
IEEE
15 years 7 months ago
1997
IEEE
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
139
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...