Abstract
We address the semantics and normative questions for reasoning with presumptive arguments: How are presumptive arguments grounded in interpretations; and when are they evaluated as correct? For deductive and uncertain reasoning, classical logic and probability theory provide canonical answers to these questions. Staying formally close to these, we propose case models and their preferences as formal semantics for the interpretation of presumptive arguments. Arguments are evaluated as presumptively valid when they make a case that is maximally preferred. By qualitative and quantitative representation results, we show formal relations between deductive, uncertain and presumptive reasoning. In this way, the work is a step to the connection of logical and probabilistic approaches in AI.
Cite
CITATION STYLE
Verheij, B. (2016). Correct grounded reasoning with presumptive arguments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10021 LNAI, pp. 481–496). Springer Verlag. https://doi.org/10.1007/978-3-319-48758-8_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.