844 search results - page 95 / 169 » Safraless Decision Procedures |
GECCO
2006
Springer
14 years 13 days ago
2006
Springer
This paper introduces a new design methodology (we call it "innovization") in the context of finding new and innovative design principles by means of optimization techni...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
AAAI
2004
13 years 10 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
IJCAI
2003
13 years 10 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...