Sciweavers

566 search results - page 41 / 114
» Array Abstractions from Proofs
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Extending Defeasible Logic and Defeasible Prolog
Abstract. Defeasible logic (DL) promotes enthymemic, argumentative reasoning on incomplete set of premisses retracted on the presence of contrary information. Defeasible Prolog (d-...
Ahti-Veikko Pietarinen
COCOON
2003
Springer
14 years 28 days ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Rational streams coalgebraically
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
Jan J. M. M. Rutten
CSL
2010
Springer
13 years 8 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
GI
2009
Springer
14 years 10 days ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer