2214 search results - page 110 / 443 » Complexity of Reasoning |
139
click to vote
CADE
2004
Springer
16 years 3 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...
140
click to vote
ICCS
2005
Springer
15 years 8 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...
121
click to vote
LICS
2002
IEEE
15 years 8 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...
130
click to vote
CL
2000
Springer
15 years 7 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...
126
click to vote
LPNMR
1997
Springer
15 years 7 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...