Sciweavers

13383 search results - page 44 / 2677
» Abstractions from proofs
Sort
View
ECAI
2004
Springer
14 years 3 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 3 months 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 10 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
TLCA
2009
Springer
14 years 4 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
KI
2009
Springer
14 years 4 months ago
Presenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...
Marvin Schiller, Christoph Benzmüller