A filtering-based general approach to learning rational constraints of epistemic graphs

DOI10.1007/978-3-031-40875-5_11zbMath1530.68245arXiv2211.02918OpenAlexW4385453518MaRDI QIDQ6179532

Xiao Chi

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.02918

zbMATH Keywords

abstract argumentationprobabilistic argumentationrule learningepistemic constraint

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Epistemic graphs for representing and reasoning with positive and negative influences of arguments
• A probabilistic approach to modelling uncertain logical arguments
• On bipolarity in argumentation frameworks
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Inductive logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A filtering-based general approach to learning rational constraints of epistemic graphs