Large-scale Parallel Stratified Defeasible Reasoning

Tachmazidis, Ilias, Antoniou, Grigoris, Flouris, Giorgos, Kotoulas, Spyros and McCluskey, T.L. (2012) Large-scale Parallel Stratified Defeasible Reasoning. In: Frontiers in Artificial Intelligence and Applications: Proceedings of ECAI 2012. IOS Press, pp. 738-743. ISBN 978-1-61499-097-0

Preview	PDF - Published Version Available under License Creative Commons Attribution Non-commercial. Download (201kB) | Preview
Preview	PDF - Accepted Version Download (201kB) | Preview

Abstract

We are recently experiencing an unprecedented explosion of available data from the Web, sensors readings, scientific databases, government authorities and more. Such datasets could benefit from the introduction of rule sets encoding commonly accepted rules or facts, application- or domain-specific rules, commonsense knowledge etc. This raises the question of whether, how, and to what extent knowledge representation methods are capable of handling huge amounts of data for these applications. In this paper, we consider inconsistency-tolerant reasoning in the form of defeasible logic, and analyze how parallelization, using the MapReduce framework, can be used to reason with defeasible rules over huge datasets. We extend previous work by dealing with predicates of arbitrary arity, under the assumption of stratification. Moving from unary to multi-arity predicates is a decisive step towards practical applications, e.g. reasoning with linked open (RDF) data. Our experimental results demonstrate that defeasible reasoning with millions of data is performant, and has the potential to scale to billions of facts.

Item control for Repository Staff only: