63 search results - page 4 / 13 » On Completeness of Logical Relations for Monadic Types |
TARK
2007
Springer
14 years 1 months ago
2007
Springer
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
DKE
2007
13 years 7 months ago
2007
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
TYPES
1995
Springer
13 years 11 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...