We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
Agostino Dovier, Andrea Formisano, Enrico Pontelli