Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...
Jan Broersen, Frank Dignum, Virginia Dignum, John-...