778 search results - page 104 / 156 » Expressiveness and complexity of graph logic |
PSTV
1993
14 years 9 days ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
IANDC
2006
13 years 11 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
PODS
2007
ACM
14 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
KESAMSTA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Imitative learning can be considered an essential task of humans development. People use instructions and demonstrations provided by other human experts to acquire knowle...
ICALP
2000
Springer
14 years 2 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...