Sciweavers

2035 search results - page 204 / 407
» On the complexity of stratified logics
Sort
View
AAAI
2007
15 years 8 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
HOTDEP
2008
122views Hardware» more  HOTDEP 2008»
15 years 8 months ago
Dependable Self-Hosting Distributed Systems Using Constraints
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...
Qin Yin, Justin Cappos, Andrew Baumann, Timothy Ro...
IJCAI
2007
15 years 8 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 7 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...