Sciweavers

4 search results - page 1 / 1
» Approximating Horn Knowledge Bases in Regular Description Lo...
Sort
View
FUIN
2010
106views more  FUIN 2010»
13 years 29 days ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen
KR
2010
Springer
13 years 8 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
ISB
2002
140views more  ISB 2002»
13 years 3 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...