6167 search results - page 109 / 1234 » Can Refinement be Automated |
129
Voted
ISMIS
1994
Springer
15 years 8 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
138
click to vote
HICSS
2010
IEEE
15 years 11 months ago
2010
IEEE
One of the challenges facing system e-government security professionals is the laborious task of sifting through numerous log files in an attempt to identify malicious traffic and...
134
click to vote
WCRE
2008
IEEE
15 years 10 months ago
2008
IEEE
Concept location techniques are designed to help isolate sections of source code that relate to specific concepts. Blind Signal Separation techniques like Singular Value Decompos...
157
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
124
Voted
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...