Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
of Abstract Argumentation Guido Boella1 , Joris Hulstijn2 , and Leendert van der Torre3 1 Universit´a di Torino 2 Vrije Universiteit, Amsterdam 3 CWI Amsterdam and Delft Universit...
Guido Boella, Joris Hulstijn, Leendert W. N. van d...