Sciweavers

881 search results - page 2 / 177
» Solving satisfiability problems with preferences
Sort
View
FLAIRS
2008
13 years 7 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
PC
2006
87views Management» more  PC 2006»
13 years 4 months ago
GridSAT: a system for solving satisfiability problems using a computational grid
In this paper, we present GridSAT
Wahid Chrabakh, Richard Wolski
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 5 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...
IJCAI
2001
13 years 6 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
IJCSA
2007
104views more  IJCSA 2007»
13 years 4 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala