8094 search results - page 341 / 1619 » Improvements in Formula Generalization |
168
click to vote
AAAI
2008
15 years 8 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
140
click to vote
AAAI
2007
15 years 8 months ago
2007
The goal of information extraction is to extract database records from text or semi-structured sources. Traditionally, information extraction proceeds by first segmenting each ca...
152
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
172
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
184
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...