257 search results - page 19 / 52 » The Complexity of Model Checking for Propositional Default L... |
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
ICSE
2003
IEEE-ACM
14 years 24 days ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
CLIMA
2008
13 years 9 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...