955 search results - page 52 / 191 » Tractable Temporal Reasoning |
CSFW
2003
IEEE
14 years 2 months ago
2003
IEEE
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
AI
2011
Springer
13 years 4 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
ICMAS
2000
13 years 10 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
ENTCS
2008
13 years 9 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...