2490 search results - page 159 / 498 » Complexity of Contextual Reasoning |
151
click to vote
CADE
2004
Springer
16 years 5 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
155
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
132
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
128
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
140
click to vote
CL
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...