Sciweavers

8094 search results - page 91 / 1619
» Improvements in Formula Generalization
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 6 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
IJAR
2007
96views more  IJAR 2007»
13 years 9 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
IJPRAI
2002
142views more  IJPRAI 2002»
13 years 8 months ago
Improving Encarta Search Engine Performance by Mining User Logs
We propose a data-mining approach that produces generalized query patterns (with generalized keywords) from the raw user logs of the Microsoft Encarta search engine (http://encart...
Charles X. Ling, Jianfeng Gao, Huajie Zhang, Weini...
SIGSOFT
2007
ACM
14 years 9 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
ATAL
2006
Springer
14 years 25 days ago
The complexity of model checking concurrent programs against CTLK specifications
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
Alessio Lomuscio, Franco Raimondi