Default argument

TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.

TL;DR: This paper considers logic-based argumentation with uncertain arguments by considering models of the language, which can be used to give a probability distribution over arguments that are constructed using classical logic, and shows how this formalization of uncertainty of logical arguments relates to uncertainty of abstract arguments.

TL;DR: This paper presents an approach to default reasoning based on an extension to classical first-order logic augmented with a "variable conditional" operator for representing default statements that is argued to be superior to the first.

TL;DR: Results are presented indicating that decision problems known to be intractable in their most general form remain so even under quite severe graph-theoretic restrictions and the problem of deciding "subjective acceptability" continues to be NP-complete even when the underlying graph is a binary tree.