We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...
Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Buss...
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da C...
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...