Sabotage modal logic was proposed in 2003 as a format for analyzing games that modify the graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has largely come to be viewed as an early dynamic logic of graph change. Our first contribution is a characterization theorem for sabotage modal logic as a fragment of first-order logic...

To overcome the inability of Description Logics (DLs) to represent vague or imprecise information, several fuzzy extensions have been proposed in the literature. In this context, an important family of reasoning algorithms for fuzzy DLs is based on a combination of tableau algorithms and Operational Research (OR) problems, specifically using Mixed Integer Linear Programming (MILP). In this pape...

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a mechanism for producing a classic-like description of them in terms of an effective variety of bivalent semantics; (ii) a mechanism for extracting, from the bival...

The following text is an annotation to Marc A. A. van Leeuwen's paper " Tableau algorithms defined naturally for pictures " in its version of 25 November 2011. This annotation contains corrections of a few mistakes. Different comments are separated by horizontal lines, like this: Page 1, §1: Replace " as a tableaux " by " as tableaux ". Page 3, §2.2: Replace " The the non-empty " by " The non-e...