19,699 research outputs found

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

    Full text link
    Forgetting is removing variables from a logical formula while preserving the constraints on the other variables. In spite of being a form of reduction, 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 DpD^p-hard in Σ2p\Sigma^p_2. The same problem for unrestricted propositional formulae is D2pD^p_2-hard in Σ3p\Sigma^p_3. The hardness results employ superredundancy: a superirredundant clause is in all formulae of minimal size equivalent to a given one. This concept may be useful outside forgetting

    Denial of Death and Economic Behavior

    Get PDF
    We model denial of death and its effect on economic behavior. Attempts to reduce death anxiety and the possibility of denial of mortality-relevant information interact with intertemporal choices and may lead to time-inconsistent behavior and other "behavioral" phenomena. In the model, repression of signals of mortality leads to underconsumption for unsophisticated individuals, but forward-sophisticated individuals may over-consume in anticipation of future denial and may seek ways to commit to act according to one's mortality prospects as currently perceived. We show that the mere possibility of engaging in this kind of denial leads to time-inconsistent but efficient behavior. Refusal to face up to the reality of death may help explain a wide range of empirical phenomena, including the underutilization of tax-advanced inter vivos gifts and inadequate purchase of life insurance.

    Beyond Hypertree Width: Decomposition Methods Without Decompositions

    Full text link
    The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of work has focused on structural restrictions, which arise from restricting the interaction among constraint scopes. In this paper, we engage in a mathematical investigation of generalized hypertree width, a structural measure that has up to recently eluded study. We obtain a number of computational results, including a simple proof of the tractability of CSP instances having bounded generalized hypertree width

    Against the realistic interpretation of the Theory of Relativity

    Get PDF
    The Theory of Relativity has been portrayed as a theory that redefined the way we look at the cosmos, enabling us to unlock the reality we live in. Its proponents are constantly reminding us of how Einstein managed to reveal the true nature of the universe with his groundbreaking theory, which has been proved multiple times until now. Yet, philosophy of science teaches us that no theory has any privileged connection with what we call reality per se. The role of science is to formulate models of the cosmos we see and not to try to interpret or reveal reality. This paper tries to show how this holds true even for the famous relativity theory, by showing specific objections to the connection of the theory with the Holy Grail of philosophers. By analyzing various subjects related to the theory, from the twins’ paradox to the GPS satellites, this paper illustrates that relativity is much less connected to reality than what we would like to think. At the end, what Einstein’s theory provides is nothing more than a way to formalize the interactions of the world but without being able to make any claims whatsoever regarding the ‘reality’ of its conclusions

    Belief Revision with Uncertain Inputs in the Possibilistic Setting

    Full text link
    This paper discusses belief revision under uncertain inputs in the framework of possibility theory. Revision can be based on two possible definitions of the conditioning operation, one based on min operator which requires a purely ordinal scale only, and another based on product, for which a richer structure is needed, and which is a particular case of Dempster's rule of conditioning. Besides, revision under uncertain inputs can be understood in two different ways depending on whether the input is viewed, or not, as a constraint to enforce. Moreover, it is shown that M.A. Williams' transmutations, originally defined in the setting of Spohn's functions, can be captured in this framework, as well as Boutilier's natural revision.Comment: Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996
    corecore