Sciweavers

2490 search results - page 46 / 498
» Complexity of Contextual Reasoning
Sort
View
KR
2010
Springer
15 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
172
Voted
LPAR
1999
Springer
15 years 7 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
124
Voted
TIME
2005
IEEE
15 years 9 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
127
Voted
DEXA
2004
Springer
161views Database» more  DEXA 2004»
15 years 9 months ago
Computing the Topological Relationship of Complex Regions
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
Markus Schneider
136
Voted
DLOG
1998
15 years 5 months ago
A Description Logic System for Learning in Complex Domains
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
Jordi Alvarez