Sciweavers

11160 search results - page 391 / 2232
» Incompleteness in a General Setting
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Goal Revision for a Rational Agent
We propose a general framework to represent changes in the mental state of a rational agent due to the acquisition of new information and/or to the arising of new desires; fundamen...
Célia da Costa Pereira, Andrea Tettamanzi, ...
DAGSTUHL
2006
15 years 8 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
AML
2006
49views more  AML 2006»
15 years 7 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
15 years 6 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
CORR
2006
Springer
172views Education» more  CORR 2006»
15 years 6 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan