Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
Interactive narrative is a blossoming field, with new systems and approaches being developed each year. However, despite this burgeoning array of designs, little work has been don...
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
In this paper we present a novel approach for patternconstrained test case generation. The generation of test cases with known characteristics is usually a non-trivial task. In co...