1331 search results - page 82 / 267 » Description logic reasoning using the PTTP approach |
198
click to vote
DLOG
2007
15 years 8 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
165
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
146
click to vote
KR
1994
Springer
15 years 10 months ago
1994
Springer
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
170
click to vote
IJCAI
1997
15 years 7 months ago
1997
The objective of this work is to interpret inductive results obtained by the unsupervised learning method OSHAM. We briefly introduce the learning process of OSHAM, that extracts ...
145
click to vote
DLOG
2006
15 years 7 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...