188 search results - page 11 / 38 » What Is a Skeptical Proof |
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Despite the wide-spread popularity of estimation of distribution algorithms (EDAs), there has been no theoretical proof that there exist optimisation problems where EDAs perform...
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
We argue for the importance of tool integration in achieving the Program Verifier Grand Challenge. In particular, we argue for what we call strong integration, i.e. a co-operative...
KR
2004
Springer
14 years 1 months ago
2004
Springer
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness pr...
CADE
1992
Springer
14 years 15 days ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
EATCS
2000
13 years 8 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...