224 search results - page 40 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
99
Voted
TPHOL
2007
IEEE
15 years 5 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
186
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
115
Voted
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
93
Voted
CADE
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
88
Voted
CONSTRAINTS
2007
14 years 11 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...