On Properties of Update Sequences Based on Causal Rejection

We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. New information is incorporated into the current knowledge base subject to a causal rejection principle enforcing that, in case of conflicts, more recent rules are preferred and older rules are overridden. Such a rejection principle is also exploited in other approaches to update logic programs, e.g., in dynamic logic programming by Alferes et al. We give a thorough analysis of properties of our approach, to get a better understanding of the causal rejection principle. We review postulates for update and revision operators from the area of theory change and nonmonotonic reasoning, and some new properties are considered as well. We then consider refinements of our semantics which incorporate a notion of minimality of change. As well, we investigate the relationship to other approaches, showing that our approach is semantically equivalent to inheritance programs by Buccafurri et al. and that it coincides with certain classes of dynamic logic programs, for which we provide characterizations in terms of graph conditions. Therefore, most of our results about properties of causal rejection principle apply to these approaches as well. Finally, we deal with computational complexity of our approach, and outline how the update semantics and its refinements can be implemented on top of existing logic programming engines.Comment: 59 pages, 2 figures, 3 tables, to be published in "Theory and Practice of Logic Programming

Super Logic Programs

The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called `super logic programs'. We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbibrary positive objective formulas. Our main results are two new and powerful characterizations of the static semant ics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions. Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a query-answering interpreter for super programs which we developed based on the model-theoretic characterization and which is available on the web.Comment: 47 pages, revised version of the paper submitted 10/200

Syntactic Computation of Hybrid Possibilistic Conditioning under Uncertain Inputs

International audienceWe extend hybrid possibilistic conditioning to deal with inputs consisting of a set of triplets composed of propositional formulas, the level at which the formulas should be accepted, and the way in which their models should be revised. We characterize such conditioning using elementary operations on possibility distributions. We then solve a difficult issue that concerns the syntactic computation of the revision of possibilistic knowledge bases, made of weighted formulas, using hybrid conditioning. An important result is that there is no extra computational cost in using hybrid possibilistic conditioning and in particular the size of the revised possibilistic base is polynomial with respect to the size of the initial base and the input

What Is a Singular Term?

This paper discusses the question whether it is possible to explain the notion of a singular term without invoking the notion of an object or other ontological notions. The framework here is that of Michael Dummett's discussion in Frege: Philosophy of Language. I offer an emended version of Dummett's conditions, accepting but modifying some suggestions made by Bob Hale, and defend the emended conditions against some objections due to Crispin Wright. This paper dates from about 1989. It originally formed part of a very early draft of what became my Ph.D. dissertation. I rediscovered it and began scanning it, when I had nothing better to do, in Fall 2001, making some minor editing changes along the way. Suffice it to say that it no longer represents my current views. I hope, however, that it remains of some small interest

Awareness-Dependent Subjective Expected Utility

We develop awareness-dependent subjective expected utility by taking unawareness structures introduced in Heifetz, Meier, and Schipper (2006, 2008, 2011a) as primitives in the Anscombe-Aumann approach to subjective expected utility. We observe that a decision maker is unaware of an event if and only if her choices reveal that the event is ``null'' and the negation of the event is ``null''. Moreover, we characterize ``impersonal'' expected utility that is behaviorally indistinguishable from awareness-dependent subject expected utility and assigns probability zero to some subsets of states that are not necessarily events. We discuss in what sense probability zero can model unawareness.unawareness, awareness, unforeseen contingencies, null, probability zero, subjective probability, Anscombe-Aumann, small worlds