881 search results - page 5 / 177 » Solving satisfiability problems with preferences |
102
Voted
ICTAI
2008
IEEE
2008
IEEE
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
15 years 10 months ago
167
Voted
DATE
1999
IEEE
15 years 8 months 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...
149
Voted
AMAI
2000
Springer
15 years 7 months 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...
135
Voted
AI
2008
Springer
15 years 3 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...
115
Voted
CP
2006
Springer
15 years 7 months 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...