Rethinking Defeasible Reasoning: A Scalable Approach
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 1.
4 papers.
- 2024Training Large Language Models for Reasoning through Reverse Curriculum Reinforcement Learningcited by 65
- 2023BoardgameQA: A Dataset for Natural Language Reasoning with Contradictory Informationcited by 44
- 2021Defeasible Reasoning via Datalog^negcited by 0
- 2021Approximating Defeasible Logics to Improve Scalabilitycited by 0
- 2024Training Large Language Models for Reasoning through Reverse Curriculum Reinforcement Learning8 Feb 2024
- 2023BoardgameQA: A Dataset for Natural Language Reasoning with Contradictory Information13 Jun 2023
- 2021Approximating Defeasible Logics to Improve Scalability11 Aug 2021
- 2021Defeasible Reasoning via Datalog^neg21 Jun 2021