Sciweavers

1302 search results - page 18 / 261
» Deductive Plan Generation
Sort
View
EPIA
1997
Springer
13 years 11 months ago
Controlling for Unexpected Goals when Planning in a Mixed-Initiative Setting
dimension of abstraction and specificity, and they may mix both top-level goals and subgoals when describing what they want a plan to do. We show how the Prodigy planning system h...
Michael T. Cox, Manuela M. Veloso
LACL
1998
Springer
13 years 11 months ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede
JAIR
2006
106views more  JAIR 2006»
13 years 7 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
AIIDE
2007
13 years 10 months ago
SquadSmart: Hierarchical Planning and Coordinated Plan Execution for Squads of Characters
This paper presents an application of Hierarchical Transition Network (HTN) planning to a squad-based military simulation. The hierarchical planner produces collaborative plans fo...
Peter Gorniak, Ian Davis
LOGCOM
2002
142views more  LOGCOM 2002»
13 years 7 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke