2233 search results - page 125 / 447 » On the Complexity of Theory Curbing |
167
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...
175
click to vote
CASC
2006
Springer
15 years 10 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
148
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
148
click to vote
DLOG
2006
15 years 7 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
163
click to vote
AAAI
1994
15 years 7 months ago
1994
We present a formal theory of model-based testing, an algorithm for test generation based on it, and outline how testing is implemented by a diagnostic engine. The key to making t...