Add to ORKGWe investigate the complexity of the model checking problem for hybrid logics. We provide model checker algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.
AbstractIn a previous paper, we have showed that Hybrid Modal Logic can be successfully used to mode...
Formal verification by model checking verifies whether a system satisfies some given correctness pro...
Abstract. Bounded model checking (BMC) is an automatic verification method that is based on finitely...
AbstractWe investigate the complexity of the model checking problem for hybrid logics. We provide mo...
This paper examines and classifies the computational complexity of model checking and satisfiability...
Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can ...
Abstract. Hybrid logics extend modal logics by first-order concepts, in particular they allow a limi...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
We investigate expressivity and complexity of hybrid logics on linear structures. Hy-brid logics are...
The large volume and nature of data available to the casual users and programs motivate the increasi...
Abstract. We study consistency, satisfiability, and validity problems for collectively model checkin...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is und...
The model checking problem for various fragments of first-order logic has attracted much atten-tion ...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
AbstractIn a previous paper, we have showed that Hybrid Modal Logic can be successfully used to mode...
Formal verification by model checking verifies whether a system satisfies some given correctness pro...
Abstract. Bounded model checking (BMC) is an automatic verification method that is based on finitely...
AbstractWe investigate the complexity of the model checking problem for hybrid logics. We provide mo...
This paper examines and classifies the computational complexity of model checking and satisfiability...
Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can ...
Abstract. Hybrid logics extend modal logics by first-order concepts, in particular they allow a limi...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
We investigate expressivity and complexity of hybrid logics on linear structures. Hy-brid logics are...
The large volume and nature of data available to the casual users and programs motivate the increasi...
Abstract. We study consistency, satisfiability, and validity problems for collectively model checkin...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is und...
The model checking problem for various fragments of first-order logic has attracted much atten-tion ...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
AbstractIn a previous paper, we have showed that Hybrid Modal Logic can be successfully used to mode...
Formal verification by model checking verifies whether a system satisfies some given correctness pro...
Abstract. Bounded model checking (BMC) is an automatic verification method that is based on finitely...