1063 search results - page 41 / 213 » Order and Negation as Failure |
111
Voted
FTP
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
112
Voted
AML
2005
15 years 22 days ago
2005
IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an i...
90
Voted
JCT
2007
15 years 21 days ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
1 Query-by-example information retrieval provides users a flexible but efficient way to accurately describe their information needs. The query exemplars are usually long and in th...
121
Voted
SIGCSE
2010
ACM
15 years 7 months ago
2010
ACM
The “Hacker Curriculum” exists as a mostly undocumented set of principles and methods for learning about information security. Hacking, in our view, is defined by the ability...