Baral, C. and Gabaldon, A. and Provetti, Alessandro (1998) Value minimization in circumscription. Artificial Intelligence 102 (2), pp. 163-186. ISSN 0004-3702.
Abstract
Minimization in circumscription has focussed on minimizing the extent of a set of predicates (with or without priorities among them), or of a formula. Although functions and other constants may be left varying during circumscription, no earlier formalism to the best of our knowledge minimized functions. In this paper we introduce and motivate the notion of value minimizing a function in circumscription. Intuitively, value minimizing a function consists in choosing those models where the value of the function is minimal relative to an ordering on its range. We first give the formulation of value minimization of a single function based on a syntactic transformation and then give a formulation in model-theoretic terms. We then discuss value minimization of a set of functions with and without priorities. We show how Lifschitz's Nested Abnormality Theories can be used to express value minimization, and discuss the prospect of its use for knowledge representation, particularly in formalizing reasoning about actions.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 10 Aug 2021 08:26 |
| Last Modified: | 09 Aug 2023 12:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/45395 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
