Defeasible Reasoning with Structured Information.

摘要: There is a wide variety of approaches to formalising non-monotonic reasoning, and even though some relationships between formalisms have been established, there lack appropriate general frameworks support such analyses. successes as using properties the consequence relation framework (Gabbay 1985, Makinson 1989, Kraus 1990), with argument systems (Lin Vreeswijk 1991, Simari 1992), but these only provide relatively high level views on formalisms. We require lower level, higher resolution, for analysing logics, suggesting new logics that are better suited practical reasoning. To address this we label formulae in our databases, represent extra information about formula. The proof rules propagate labels relations select preferred inferences according preference criteria. Here show how different can be characterized terms labelling strategies, algebras labels, rules, also discuss aggregation criteria compare Doyle Wellman (1991).