Rethinking Defeasible Reasoning: A Scalable Approach
From MaRDI portal
Publication:4957204
DOI10.1017/S1471068420000010zbMath1472.68191arXiv2001.00406MaRDI QIDQ4957204
Long Cheng, Stephen Wade, Grigoris Antoniou, Michael J. Maher, Ilias Tachmazidis
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00406
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing strong and weak permissions in defeasible logic
- Efficient Computation of the Well-Founded Semantics over Big Data
- An inclusion theorem for defeasible logics
- Representation results for defeasible logic
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The well-founded semantics for general logic programs
- Propositional defeasible logic has linear complexity
- Scaling-up reasoning and advanced analytics on BigData
- Annotated defeasible logic
- Relative expressiveness of defeasible logics
- Relative expressiveness of defeasible logics II