202 search results - page 16 / 41 » Reasoning about XML with temporal logics and automata |
ICAIL
2007
ACM
15 years 1 months ago
2007
ACM
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
ENTCS
2007
14 years 9 months ago
2007
Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
124
click to vote
LICS
2012
IEEE
13 years 3 days ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...