Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
—The vision of network robot systems involves robots embedded in smart environments, with which they can collaborate and communicate. In such systems, robots have access to many ...
Abstract. In spatial reasoning the qualitative description of relations between spatial regions is of practical importance and has been widely studied. Examples of such relations a...