Sciweavers

2178 search results - page 14 / 436
» Inferring complex plans
Sort
View
ATAL
2004
Springer
13 years 11 months ago
Automated Conversion and Simplification of Plan Representations
As planning agents grow more sophisticated, issues of plan representation arise alongside concerns with plan generation. Planning methods work over increasingly large and difficul...
Martin Allen, Shlomo Zilberstein
LPAR
2007
Springer
14 years 1 months ago
Complexity of Planning in Action Formalisms Based on Description Logics
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
ALT
2006
Springer
14 years 4 months ago
The Complexity of Learning SUBSEQ (A)
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
Stephen A. Fenner, William I. Gasarch
UAI
2000
13 years 9 months ago
Probabilistic State-Dependent Grammars for Plan Recognition
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
David V. Pynadath, Michael P. Wellman