Nonmonotonic reasoning with multiple belief sets

  • Authors:
  • Joeri Engelfriet;Heinrich Herre;Jan Treur

  • Affiliations:
  • Faculty of Sciences, Department of Artificial Intelligence, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands E-mail: {joeri,treur}@cs.vu.nl;University of Leipzig, Department of Computer Science, Augustplatz 10‐11, 04109 Leipzig, Germany E-mail: herre@informatik.uni‐leipzig.de;Faculty of Sciences, Department of Artificial Intelligence, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands E-mail: {joeri,treur}@cs.vu.nl

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In complex reasoning tasks it is often the case that there is no single, correct set of conclusions given some initial information. Instead, there may be several such conclusion sets, which we will call belief sets. In the present paper we introduce nonmonotonic belief set operators and selection operators to formalize and to analyze structural aspects of reasoning with multiple belief sets. We define and investigate formal properties of belief set operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief set operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selection operators connected to belief set operators, which are used to choose some of the possible belief sets.