Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
In this paper we present a novel approach for combining Case-Based Reasoning (CBR) and Argumentation. This approach involves 1) the use of CBR for evaluating the arguments submitt...
Consistent and flawless communication between humans and machines is the precondition for a computer to process instructions correctly. While machines use well-defined languages an...