Sciweavers

1063 search results - page 41 / 213
» Order and Negation as Failure
Sort
View
FTP
1998
Springer
14 years 2 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
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...
Ullrich Hustadt, Renate A. Schmidt
AML
2005
76views more  AML 2005»
13 years 9 months ago
Perfect and bipartite IMTL-algebras and disconnected rotations of prelinear semihoops
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...
Carles Noguera, Francesc Esteva, Joan Gispert
JCT
2007
95views more  JCT 2007»
13 years 9 months ago
Directed tree-width examples
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...
Isolde Adler
ICASSP
2011
IEEE
13 years 1 months ago
Handling verbose queries for spoken document retrieval
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...
Shih-Hsiang Lin, Ea-Ee Jan, Berlin Chen
SIGCSE
2010
ACM
181views Education» more  SIGCSE 2010»
14 years 4 months ago
Teaching the principles of the hacker curriculum to undergraduates
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...
Sergey Bratus, Anna Shubina, Michael E. Locasto