A variety of application domains are interactive in nature: a primary task involves responding to external actions. In this paper, we introduce explicit programming language suppor...
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Abstract. Across a wide range of domains, there is an urgent need for a wellfounded approach to incorporating uncertain and incomplete knowledge into formal domain ontologies. Alth...