175 search results - page 13 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
100
click to vote
FMICS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled...
KI
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
LOGCOM
2010
14 years 8 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
TIME
2009
IEEE
15 years 4 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
113
Voted
FROCOS
2011
Springer
13 years 9 months ago
2011
Springer
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...