Sciweavers

573 search results - page 14 / 115
» Planning as Satisfiability with Preferences
Sort
View
KES
2006
Springer
13 years 7 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
TSMC
2010
13 years 2 months ago
Active Learning of Plans for Safety and Reachability Goals With Partial Observability
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
Wonhong Nam, Rajeev Alur
PLDI
2006
ACM
14 years 1 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
AAAI
1996
13 years 9 months ago
On the Size of Reactive Plans
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...
Peter Jonsson, Christer Bäckström