We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
Abstract. The newly developed behavioral approach to the algebraization of logics extends the applicability of the methods of algebraic logic to a wider range of logical systems, n...
Electronic Brokering, is a good candidate for taking up Semantic Web technology. In this paper we study the brokering and matchmaking problem that is, how a requester’s requirem...
Grigoris Antoniou, Thomas Skylogiannis, Antonis Bi...
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...