Sciweavers

550 search results - page 38 / 110
» Context Semantics, Linear Logic and Computational Complexity
Sort
View
JAPLL
2010
179views more  JAPLL 2010»
14 years 8 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
RR
2010
Springer
14 years 8 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
CCECE
2006
IEEE
15 years 3 months ago
A Dynamic Associative E-Learning Model based on a Spreading Activation Network
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...
Phongchai Nilas, Nilamit Nilas, Somsak Mitatha
IROS
2009
IEEE
163views Robotics» more  IROS 2009»
15 years 4 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
Ioan Alexandru Sucan, Lydia E. Kavraki
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 4 months ago
Ontology-Based Reasoning for Supporting Context-Aware Services on Autonomic Networks
- Ontology engineering has been proposed as a formal mechanism for both reducing the complexity of managing the information needed in network management and autonomic systems and f...
Jaime Martín Serrano, Joan Serrat, John Str...