Sciweavers

1101 search results - page 93 / 221
» Forcing in proof theory
Sort
View
LORI
2009
Springer
15 years 7 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
KR
1998
Springer
15 years 4 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
104
Voted
TAPSOFT
1997
Springer
15 years 4 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
APLAS
2007
ACM
15 years 4 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
98
Voted
DAGSTUHL
1996
15 years 1 months ago
On-line Algorithms in Machine Learning
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
Avrim Blum