881 search results - page 20 / 177 » Solving satisfiability problems with preferences |
FLAIRS
2008
13 years 11 months ago
2008
It is well-known that default reasoning and preference-based decision making both make use of preferential relations between possible worlds resp. alternatives. In this paper, we ...
DATE
2008
IEEE
13 years 10 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
AUSAI
2007
Springer
14 years 19 days ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
JSAT
2008
13 years 8 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
VLSID
1999
IEEE
14 years 27 days ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...