Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...