We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
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...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
In this paper we present query filtering techniques based on bottom-up tree automata for XML access control. In our authorization model (RXACL), RDF statements are used to represen...