| C. Baral, A. Gabaldon, and A. Provetti. Value minimization in circumscription. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, KR'96: Principles of Knowledge Representation and Reasoning, pages 474--481. Morgan Kaufmann, San Francisco, California, 1996. |
....by a number of authors and are gaining popularity as a circumscriptive knowledge representation tool. For example, NATs have been used in reasoning about actions [25, 24, 31, 32, 48] for handling the qualification problem [39] formalizing narratives [3] expressing function value minimization [2], information filtering [1] describing action selection in planning [47] and in spatial reasoning [43] As another simple example for combining circumscriptions, imagine the task to diagnose a malfunctioning artifact which is composed of modular components, e.g. a car. A piece of knowledge ....
C. Baral, A. Gabaldon, and A. Provetti. Value minimization in circumscription. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, KR'96: Principles of Knowledge Representation and Reasoning, pages 474--481. Morgan Kaufmann, San Francisco, California, 1996.
....demonstrates the usefulness of NATs for knowledge representation. 1.5. Other contributions An additional and important contribution of this work is that the formalization presented here constitutes a full, nontrivial example of the use of value minimization, a technique developed by Baral et al. [6] for minimizing the value of a function in a circumscriptive theory. Value minimization is used in our formalization to capture the assumption that the only action occurrences which can be derived from a set of observations are those which are necessary to explain the observations themselves. In ....
....so that we can check whether they are entailed by the NAT theory. For hypotheses of the form (5) the translation, #( F after [A 1 , A m ] at S i ) is defined as follows: ##) Concatenate(Sit map(S i ) A n ##A 1 # #, #) # ( Holds(F,#) 9) 5. Value minimization of functions In [6], we introduced the concept of value minimizing a function. That is, forcing a function to map the elements of its domain onto minimal elements of its range, where the minimality criterion is with respect to an arbitrary partial order defined on the range. This is completely different from all ....
[Article contains additional citation context not shown here]
C. Baral, A. Gabaldon, A. Provetti, Value minimization in circumscription, in: L.C. Aiello, J. Doyle, S. Shapiro (Eds.), Proc. Principles of Knowledge Representation and Reasoning (KR-96), 1996, pp. 474-- 481.
....by the Texas action group where the idea of filtering is used are: The notion of nested circumscription in [Lif95] is a generalization of the notion of filtering where multiple levels of filtering can be expressed. Nested circumscription is used in his works in [KL94] and also by others in [BGP98b,BGP98a] for formalizing reasoning about actions. Lifschitz in [Lif99] points out that writing observations as constraints as opposed to facts that are directly added to the theory, as one of the three principles followed by McCain and Turner in their formulation [MT97,Tur97] using Reiter s ....
.... consequents (or false as the consequent) and in case of logic programs constraints are represented using rules with empty head (or false in the head) Baral and Gelfond also represent observations as constraints in their logic programming formulation in [BG97] and Baral, Gabaldon and Provetti in [BGP98b,BGP98a] use nested circumscription to formulate narratives. 1.2 Relating filtering and abductive reasoning: Motivations Besides the fact that both filtering and abductive reasoning are used for assimilating observations, our motivations to study the relationship between the two are as follows: ....
C. Baral, A. Gabaldon, and A. Provetti. Value minimization in circumscription. Artificial Inteligence, 102(2):163--186, July 1998.
....of our translation of L (as presented in this paper) demonstrates the usefulness of NATs for knowledge representation. An additional and important contribution of this work is that the formalization presented here constitutes a full, and non trivial example of the use of value minimization [BarGabPro96b] a technique developed by Baral et al. for minimizing the value of a function in a circumscriptive theory. This technique is used in our formalization to capture the assumption that the only action occurrences which can be derived from a set of observations are those which are necessary to ....
....to translate them to check if they are entailed by the translation of a domain description. For a hypothesis of the form (5) its translation, OE) is the following: 8fi)Concatenate(Sit map(SN ) A n ffi : ffi A 1 ffi ffl; fi) oe ( Holds(F; fi) 5 Value minimization of functions in T In [BarGabPro96b] we introduce the concept of value minimizing a function. That is, forcing a function to map the elements of its domain onto minimal elements of its co domain, where the minimality criterion is with respect to an arbitrary partial order defined on the co domain. This is completely different from ....
[Article contains additional citation context not shown here]
Baral C., Gabaldon A. and Provetti A. 1996. Value Minimization in Circumscription. In L.C. Aiello, J. Doyle and S. Shapiro, Proceedings of Knowledge Representation and Reasoning (KR96), pp. 474--481, Cambridge, Massachusetts.
....the usefulness of NATs for knowledge representation. 1. 5 Other contributions An additional and important contribution of this work is that the formalization presented here constitutes a full, non trivial example of the use of value 6 minimization, a technique developed by Baral et al. BarGabPro96b] for minimizing the value of a function in a circumscriptive theory. Value minimization is used in our formalization to capture the assumption that the only action occurrences which can be derived from a set of observations are those which are necessary to explain the observations themselves. In ....
....check whether they are entailed by the NAT theory. For hypotheses of the form (5) the translation, F after [A 1 ; Am ] at S i ) is defined as follows: 9fi) Concatenate(Sit map(S i ) A n ffi : ffi A 1 ffi ffl; fi) oe ( Holds(F; fi) 9) 5 Value minimization of functions In [BarGabPro96b] we introduced the concept of value minimizing a function. That is, forcing a function to map the elements of its domain onto minimal elements of its range, where the minimality criterion is with respect to an arbitrary partial order defined on the range. This is completely different from all ....
[Article contains additional citation context not shown here]
Baral C., Gabaldon A. and Provetti A. 1996. Value Minimization in Circumscription. In L.C. Aiello, J. Doyle and S. Shapiro, Proceedings of Knowledge Representation and Reasoning (KR'96), pp. 474--481.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC