881 search results - page 5 / 177 » Solving satisfiability problems with preferences |
ICTAI
2008
IEEE
2008
IEEE
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
14 years 3 months ago
DATE
1999
IEEE
14 years 28 days ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
AMAI
2000
Springer
14 years 6 days ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
CP
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...