Gerard Vreeswijk

Approximate defeasible reasoning

Argument-based nonmonotonic reasoning relies on a principle, known as defeat among arguments. The key-idea in defeat among arguments is that a logical statement holds if (and only if) that statement is supported by an argument that remains undefeated. In this paper we show that finding out whether an argument remains undefeated is NP-complete. We then suggest tractable algorithms that approximate the ultimate division of defeated, undefeated and undetermined arguments.

Maastricht Argument Day: abstracts