Sciweavers

66 search results - page 9 / 14
» Survey propagation: an algorithm for satisfiability
Sort
View
CP
2007
Springer
13 years 11 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
DAC
2009
ACM
14 years 8 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
ALT
2003
Springer
13 years 11 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
CADE
2009
Springer
14 years 8 months ago
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
Florian Widmann, Rajeev Goré
I3E
2008
234views Business» more  I3E 2008»
13 years 9 months ago
Development of Recommender Systems Using User Preference Tendencies: An Algorithm for Diversifying Recommendation
Abstract. Many e-commerce sites use a recommendation system to filter the specific information that a user wants out of an overload of information. Currently, the usefulness of the...
Yuki Ogawa, Hirohiko Suwa, Hitoshi Yamamoto, Isamu...