Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
Guido Boella, Dov M. Gabbay, Valerio Genovese, Lee...
Qualitative spatial information plays a key role in many applications. While it is well-recognized that all but a few of these applications deal with spatial information that is a...
Steven Schockaert, Martine De Cock, Chris Cornelis...
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...