186,913 research outputs found

    The ghosts of forgotten things: A study on size after forgetting

    No full text
    Forgetting is removing variables from a logical formula while preserving the constraints on the other variables. In spite of reducing information, it does not always decrease the size of the formula and may sometimes increase it. This article discusses the implications of such an increase and analyzes the computational properties of the phenomenon. Given a propositional Horn formula, a set of variables and a maximum allowed size, deciding whether forgetting the variables from the formula can be expressed in that size is Dp-hard in Σ2p. The same problem for unrestricted CNF propositional formulae is D2p-hard in Σ3p

    Belief merging in absence of reliability information

    No full text
    Merging beliefs depends on the relative reliability of their sources. When this is information is absent, assuming equal reliability is unwarranted. The solution proposed in this article is that every reliability profile is possible, and only what holds according to all of them is accepted. Alternatively, one source is completely reliable, but which one is not specified. These two cases motivate two existing forms of merging: maxcons-based merging and disjunctive merging

    Institutiones philosophicae P. Matthaei Liberatore.

    No full text
    Contents: Logica et metaphysica generalis. - Metaphysici specialis. - Ethica et ius naturalMode of access: Internet

    Liberatore-Corsi, Cosmologia. Editio altera emendata

    No full text
    Grégoire Auguste. Liberatore-Corsi, Cosmologia. Editio altera emendata. In: Revue néo-scolastique de philosophie. 39ᵉ année, Deuxième série, n°52, 1936. p. 536

    The complexity of belief update

    No full text
    Belief revision and belief update are two different forms of belief change, and they serve different purposes. In this paper we focus on belief update, the formalization of change in beliefs due to changes in the world. The complexity of the basic update (introduced by Winslett [1990]) has been determined in [Eiter and Gottlob, 1992]. Since then, many other formalizations have been proposed to overcome the limitations and drawbacks of Winslett's update. In this paper we analyze the complexity of the proposals presented in the literature, and relate some of them to previous work on closed world reasoning
    corecore