713 search results - page 11 / 143 » Model Checking and Transitive-Closure Logic |
CIE
2008
Springer
13 years 11 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
ENTCS
2010
13 years 11 months ago
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...
DBPL
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
ISMVL
2003
IEEE
14 years 4 months ago
2003
IEEE
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...