Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Realistic and complex planning situations require a mixed-initiative planning framework in which human and automated planners interact to mutually construct a desired plan. Ideally...