291 search results - page 27 / 59 » On the Complexity of Fragments of Modal Logics |
83
Voted
PODS
2005
ACM
15 years 12 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...
KR
2010
Springer
15 years 4 months ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
IJCAI
2007
15 years 1 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
103
click to vote
IANDC
2007
14 years 11 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...