Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...