295 search results - page 45 / 59 » SAT, SMT and Applications |
124
Voted
ENTCS
2007
15 years 1 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
112
Voted
PRICAI
2010
Springer
15 years 8 days ago
2010
Springer
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
137
Voted
JAIR
2010
14 years 8 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
170
Voted
FOGA
2011
14 years 5 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
115
click to vote
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...