2082 search results - page 21 / 417 » Change Paths in Reasoning! |
DAC
1992
ACM
13 years 11 months ago
1992
ACM
VC
2010
13 years 6 months ago
2010
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
DLOG
2007
13 years 10 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...