Sciweavers

7289 search results - page 223 / 1458
» A Dependent Set Theory
Sort
View
LPNMR
1999
Springer
14 years 18 days ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 8 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
LPNMR
2009
Springer
14 years 2 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 8 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
SDM
2009
SIAM
191views Data Mining» more  SDM 2009»
14 years 5 months ago
Adaptive Concept Drift Detection.
An established method to detect concept drift in data streams is to perform statistical hypothesis testing on the multivariate data in the stream. Statistical decision theory off...
Anton Dries, Ulrich Rückert