1743 search results - page 8 / 349 » Generalized Modal Satisfiability |
91
Voted
LOGCOM
2008
15 years 2 months ago
2008
109
Voted
PODS
2005
ACM
16 years 2 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
119
Voted
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
EUSFLAT
2007
15 years 3 months ago
2007
We propose a general semantic notion of modal many-valued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing litera...
127
click to vote
ICFEM
2009
Springer
15 years 5 days ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...