605 search results - page 36 / 121 » Dealing with logical omniscience |
CADE
2000
Springer
14 years 2 hour ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
DLOG
2000
13 years 9 months ago
2000
In this contribution we present an empirical analysis of the performance of the ALCNHR+ description logic system RACE applied to TBoxes with a very large number of primitive conce...
AGP
2003
IEEE
14 years 29 days ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
FSKD
2006
Springer
13 years 11 months ago
2006
Springer
Data mining tools generally deal with highly structured and precise data. However, classical methods fail to handle imprecise or uncertain information. This paper proposes a neuro-...