We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Agents’ pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural an...
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
128 views126 votes15 years 3 months ago TOCL 2008»
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
119 views117 votes15 years 3 months ago ENTCS 2010»
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
249 views194 votes15 years 1 months ago MFCS 2010»
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
— This paper deals with LTI interconnected systems whose subsystems have coupled dynamics. The objective is to decentralize a given centralized controller satisfying some prescri...