Rethinking Defeasible Reasoning: A Scalable Approach

Loading...
Thumbnail Image
File version

Accepted Manuscript (AM)

Author(s)
Maher, MJ
Tachmazidis, ILIAS
Antoniou, G
Wade, S
Cheng, LONG
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2020
Size
File type(s)
Location
License
Abstract

Recent technological advances have led to unprecedented amounts of generated data that originate from the Web, sensor networks, and social media. Analytics in terms of defeasible reasoning-for example, for decision making-could provide richer knowledge of the underlying domain. Traditionally, defeasible reasoning has focused on complex knowledge structures over small to medium amounts of data, but recent research efforts have attempted to parallelize the reasoning process over theories with large numbers of facts. Such work has shown that traditional defeasible logics come with overheads that limit scalability. In this work, we design a new logic for defeasible reasoning, thus ensuring scalability by design. We establish several properties of the logic, including its relation to existing defeasible logics. Our experimental results indicate that our approach is indeed scalable and defeasible reasoning can be applied to billions of facts.

Journal Title

Theory and Practice of Logic Programming

Conference Title
Book Title
Edition
Volume

20

Issue

4

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2020 Association for Logic Programming. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.

Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Software engineering

Persistent link to this record
Citation

Maher, MJ; Tachmazidis, ILIAS; Antoniou, G; Wade, S; Cheng, LONG, Rethinking Defeasible Reasoning: A Scalable Approach, Theory and Practice of Logic Programming, 2020, 20 (4), pp. 552-586

Collections