1322 search results - page 114 / 265 » Unsound Theorem Proving |
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
LPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...