74 search results - page 13 / 15 » The Complexity of Reasoning for Fragments of Autoepistemic L... |
180
click to vote
CJ
2006
15 years 6 months ago
2006
Most microprocessor chips today use an out-of-order instruction execution mechanism. This mechanism allows superscalar processors to extract reasonably high levels of instruction ...
187
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
149
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
146
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
173
click to vote
DOCENG
2006
ACM
16 years 1 days ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...