106 search results - page 3 / 22 » A logic you can count on |
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
ASIAN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
DOCENG
2009
ACM
13 years 12 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
SAS
2004
Springer
13 years 10 months ago
2004
Springer
Role logic is a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of role logic corresponds to two-va...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of ro...