1350 search results - page 80 / 270 » Reasoning about Staged Computation |
126
Voted
DLOG
2009
15 years 6 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
127
Voted
EPART
2011
14 years 5 months ago
2011
Abstract. The Structured Online Consultation tool (SCT) is a component tool in the IMPACT Project which is used to construct and present detailed surveys that solicit feedback from...
149
Voted
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
139
click to vote
PLDI
2010
ACM
16 years 2 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
146
Voted
DLOG
2008
15 years 7 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...