Sciweavers

324 search results - page 41 / 65
» Repairing Incomplete Reasoners
Sort
View
AAAI
2006
15 years 1 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
PVLDB
2008
94views more  PVLDB 2008»
14 years 11 months ago
Dynamic active probing of helpdesk databases
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to fi...
Shenghuo Zhu, Tao Li, Zhiyuan Chen, Dingding Wang,...
SEMWEB
2010
Springer
14 years 9 months ago
Optimising Ontology Classification
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...
Birte Glimm, Ian Horrocks, Boris Motik, Giorgos St...
ATAL
2004
Springer
15 years 5 months ago
The SPARK Agent Framework
There is a need for agent systems that can scale to realworld applications, yet retain the clean semantic underpinning of more formal agent frameworks. We describe the SRI Procedu...
David N. Morley, Karen L. Myers
IUI
2006
ACM
15 years 5 months ago
Linking messages and form requests
Large organizations with sophisticated infrastructures have large form-based systems that manage the interaction between the user community and the infrastructure. In many cases, ...
Anthony Tomasic, John Zimmerman, Isaac Simmons