Computational Intelligence · 1995 · 266 citations · 30 references
ComputingComputer ScienceKnowledge RepresentationLogicSemanticsArgumentationArgumentation TheoryAutomated ReasoningFormal SemanticsUncertainty ReasoningUncertainty RepresentationAggregationCategory-theoretic FoundationsCategory-theoretic LogicComputational ArgumentationData DictionariesFormal ArgumentationReasoning About UncertaintyTheory Of Arguments
We present the syntax and proof theory of a logic of argumentation, LA. We also outline the development of a category theoretic semantics for LA. LA is the core of a proof theoretic model for reasoning under uncertainty. In this logic, propositions are labeled with a representation of the arguments which support their validity. Arguments may then be aggregated to collect more information about the potential validity of the propositions of interest. We make the notion of aggregation primitive to the logic, and then define strength mappings from sets of arguments to one of a number of possible dictionaries. This provides a uniform framework which incorporates a number of numerical and symbolic techniques for assigning subjective confidences to propositions on the basis of their supporting arguments. These aggregation techniques are also described with examples.
30
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11
David Nelson · Journal of Symbolic Logic · 1949 · 418 citations