The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
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...
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...