3446 search results - page 30 / 690 » A Reasoning Algorithm for pD* |
220
click to vote
DLOG
2011
14 years 10 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
378
Voted
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
This report summarizes a PhD research effort to implement a type of logic programming language called “axiomatic language”. Axiomatic language is intended as a specification...
242
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
152
click to vote
CONEXT
2007
ACM
15 years 11 months ago
2007
ACM
Disparate algorithms are being designed to decide certain basic questions in opportunistic networks. This position paper describes a nascent idea that aims to provide a single fra...
189
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ontology classification--the computation of subsumption hierarchies for classes and properties--is one of the most important tasks for OWL reasoners. Based on the algorit...