Sciweavers

JAIR
2012
254views Hardware» more  JAIR 2012»
12 years 2 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
DLOG
2011
13 years 4 months ago
Practical Epistemic Entailment Checking in SROIQ
In this paper, we present a reasoner capable of epistemic inferences in SROIQ knowledge bases. We first identify some counter intuitive effects of imposing the traditional semant...
Anees Mehdi, Sebastian Rudolph
DLOG
2011
13 years 4 months ago
Repairing Incomplete Reasoners
Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems witho...
Giorgos Stoilos, Bernardo Cuenca Grau
INFFUS
2007
88views more  INFFUS 2007»
14 years 10 days ago
A progressive query language and interactive reasoner for information fusion support
Previous approaches in query processing do not consider queries to automatically combine results obtained from different information sources, i.e. they do not support information...
Shi-Kuo Chang, Erland Jungert, Xin Li
AAAI
2008
14 years 1 months ago
Personalized Reasoner Based on Belief Strengths of Information Sources
Traditionally, only “individual-independent” facts are inputted to a reasoner. The reasoner will produce the same answer to the same question, regardless of who the questioner...
Shu-Bin Cai, Zhong Ming, Shi-xian Li
ATAL
2008
Springer
14 years 2 months ago
Simultaneously modeling humans' preferences and their beliefs about others' preferences
In strategic multiagent decision making, it is often the case that a strategic reasoner must hold beliefs about other agents and use these beliefs to inform its decision making. T...
Sevan G. Ficici, Avi Pfeffer
ECAI
2006
Springer
14 years 4 months ago
Knowing Minimum/Maximum n Formulae
Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean `the reasoner has at least n different beliefs'. The resul...
Thomas Ågotnes, Natasha Alechina
PRICAI
1998
Springer
14 years 4 months ago
Point-Based Approaches to Qualitative Temporal Reasoning
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
Tim Van Allen, James P. Delgrande, Arvind Gupta
CSL
2001
Springer
14 years 5 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
Frédéric Koriche