| Shoham, Y.: Nonmonotonic Logics: Meaning and Utility, In: J. McDermott (ed.), Proc. 10th International Joint Conference on Artificial Intelligence, IJCAI-87, Morgan Kaufmann, 1987, pp. 388-393 |
.... can be written either at the level of the possible alternative sets of beliefs that are the intended outcomes, or at the level of reasoning patterns to construct these outcomes (or both) The first type of specifications at least covers approaches such as preferential semantics (cf. SHO 87] and the notion of S expansions for modal nonmonotonic logics (cf. MT 93] The second type at least covers approaches like default logic (cf. REI 80] The general specification framework (and its semantics) introduced here provides a unifying perspective on these and other well known ....
....consequence: the syntactical form in which the initial facts are given, is not important. Belief state operator for preferential semantics Level 1 semantically consists of descriptions of nonmonotonic reasoning using belief state frames. As an example we consider preferential semantics (cf. SHO 87] Let a preference relation on Mod be given. A belief state operator (with single belief states) can be defined in the following manner: for each X L (X) m Mod m is minimal in Mod(X) Preferential semantics essentially provides a level 1 description, abstracting from ....
[Article contains additional citation context not shown here]
Shoham, Y.: "Nonmonotonic Logics: Meaning and Utility", in: J. McDermott (ed.), Proc. 10th International Joint Conference on Artificial Intelligence, IJCAI-87, Morgan Kaufmann, 1987, pp. 388-393.
....infix notation. Definition 2 (Value minimal) Let T be a theory, let F be a function and Z a tuple of predicate function constants in the language of T . Let R be a partial order defined over the elements of the universe. For two models M and M 0 of 3 Please refer to Lifschitz [6] and Shoham [12] for a general discussion and results on preferential models. 4 This is possible in presence of (i) explicit domain property (each element of the domain has a name) and (ii) categoricity of the ordering defined within the theory. 7 T , we say M (F ;R) Z M 0 if (i) jM j = jM 0 j; ii) ....
Y. Shoham. Nonmonotonic logics: meaning and utility. Proc. the of 10th IJCAI Conference, (1987) 388--393. 29
....preferred models 3.1 Preferred models Here, we add to the classical propositional logic a preference relation between the D interpretations. Let S be a set of symbols, let D S. Let OE be a strict partial order on the set of D interpretations. If D = S, we recover preferential entailment (see [12] for more details) Let M1 ; M2 2 ID , M1 OE M2 means that the D interpretation M2 is strictly preferred over the D interpretation M1 . Thus, we can define a semantics for this new logic: ffl Preferred D interpretations of a set F of D interpretations: the preferred D interpretations of F are the ....
Y. Shoham, `Nonmonotonic logics : Meaning and utility', in IJCAI, pp. 388--393, (1987). Logic Programming, Theorem Proving and Search 354 T. Castell, C. Cayrol, M. Cayrol, D. Le Berre
....which preference information is abduced by an observation. Thus, preference abduction is used for revising a PLP; when new information arrives at a PLP, preference abduction can produce new priorities. Commonsense (nonmonotonic) reasoning and reasoning with priorities are closely related. Shoham [51] argues that the non standard behavior of nonmonotonic reasoning is due to preference mechanisms within it. According to Shoham, nonmonotonic logics are the result of associating a standard logic with a preference relation on models . Examples of research along this line are [13,56,9] Using the ....
Y. Shoham, Nonmonotonic logics: meaning and utility, in: Proceedings of the 10th International Joint Conference on Artificial Intelligence (Morgan Kaufmann, Los Altos, CA, 1987) 388--393.
....(#) is a set of formulas from #, the set of defaults from S. A # specification (A, D) is a specification (#, A, D) Xi The semantics of a specification is a relation on the models of its axioms, representing that some of these models are better than other since they satisfy more of the defaults ([22, 34, 7]) This relation is a pre order. Definition 3 A pre order (from I) is a triple R = #, M,#) where # # Sign I is a signature from I, M # Mod I (#) is a class of interpretation structures of the signature #, # # MM is a reflexive and transitive relation among those interpretation ....
....equivalence class [m] of S # is called an extension of S. A formula belonging to all extensions of S is called a skeptical consequence of S. A formula belonging to some extension of S is called a credulous consequence of S. The usual notion of consequence is the notion of skeptical consequence ([22, 34, 21]) The notion of credulous consequence, introduced in [24] is important in the context of abduction ( 23] We do not commit to one or the other since both can be derived from the chosen semantics. Theories and Galois Connection The theory of a specification S is a special representative of the ....
Y. Shoham. Nonmonotonic logics: meaning and utility. In Proceedings of IJCAI-87, pages 388--392, Milan, 1987. 15
....[ Reiter and Criscuolo, 1981 ] However, representing such dependencies explicitly in rules is inconvenient, and complicates the maintenance of sets of rules. Another line of research distinct from autoepistemic logic and other nonmonotonic logics based on consistency uses model preference [ Shoham, 1987; Kraus et al. 1990 ] Shoham denes a general framework of preferential logics in which both nonmonotonicity and resolution of conAEicts between defaults are achieved using model preference. Kraus et al. 1990 ] use a framework similar to Shoham s for dening logics in which conAEicts are solved ....
Shoham, Y.: Nonmonotonic logics: meaning and utility. In D. McDermott, editor, Proceedings of the 10th International Joint Conference on Articial Intelligence, pages 388393, Milano, 1987.
.... a set of alternative, incompatible models for a single scenario, how can we select the most appropriate one Shoham answered this by proposing model preference semantics by which the set of models is partially ordered by means of some preference criterion appropriate to the intended application (Shoham 1987). In the Transition Calculus we adopt a preference criterion corresponding to our determination to minimise unexplained state changes. Our criterion therefore consists of enumerating the unexplained state changes in each model and selecting a model with the smallest number. The enumeration is ....
Shoham, Y.: 1987, Nonmonotonic logics: Meaning and utility, Proceedings IJCAI-87, pp. 388-- 392.
....the only situations that exist are those that result from a finite sequence of actions beginning at the initial situation. 5 Other Work The first set of solutions to the frame problem, which proposed preferring change that happened as late in time as possible, were by Lifschitz [Lif86] Shoham [Sho86a, Sho86b, Sho87b, Sho87a, Sho88b, Sho88a, SM88, Sho87c], and Kautz [Kau86, AK85] These solutions are now grouped under the heading of chronological minimization, a term suggested by Shoham. It is worthwhile noting that these solutions did not change the basic default, the preference was still to assume that change happened as few times as possible, ....
Y. Shoham. Nonmonotonic logics: meaning and utility. In Proc. Tenth International Joint Conference on Artificial Intelligence (IJCAI '87), San Mateo, CA., 1987. Morgan Kaufmann.
....with intervals. 6 B x;t ; where is a tautology (13) B x;t B x;t ( oe ) oe B x;t (14) B x;t oe B x;t B x;t (15) B x;t oe B x;t :B x;t (16) We also have the rules of inference modus ponens and generalization. 3. 2 Nonmonotonic Reasoning in This Framework It has been shown[6] that many nonmonotonic logics are reducible to logical systems that utilize special semantics to select specific desirable models for their theories. In general, there will be many models for any particular set of sentences of T I. Not only do models of T I assign truth values to temporal ....
Shoham, Y. (87), Nonmonotonic Logics: Meaning and Utility, Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Milan, Italy, 1987.
....of naturals with as the usual less than or equal relation. By abuse of notation, we define: M[ power] x) x 2 ; M 0 [ power] x) x 3 : Of course, M[ power] x) M 0 [ power] x) and it is easy to establish M (power; M 0 . 5 Please refer to Lifschitz [Lif94] and Shoham [Sho87] for a general discussion and results on preferential models. 6 In this definition, ordering R is external to the theory, i.e. R is not a predicate defined in the theory. Finally, let us proceed to state that models of formula (1) are all and only those which are minimal w.r.t. F ;R) Z . ....
Y. Shoham. Nonmonotonic logics: meaning and utility. Proc. the of 10th IJCAI Conference, (1987) 388--393.
....restricted classes of models rather than all possible worlds. For example, Moore (1985) employs standard epistemic modal logics; Konolige (1985) permits one to use different incomplete sets of ordinary sound rules; Levesque (1984) employs situational models connected with relevance logic; and Shoham (1987) presents a version of circumscriptive entailment based on the concept of minimal models. Except for Shoham s, these theories of belief all agree on the essentially deductive nature of constructive beliefs. There is no requirement that either manifest or constructive beliefs be complete, but the ....
.... not presented in terms of rational choice, and their mechanization usually involves no decision theoretic calculations (see Section 8) But when closely examined, they are clearly based on rational responses to computational problems involving incomplete information (see (Doyle 1983) and (Shoham 1987)) Taking action requires information about the available actions, about their expected consequences, and about the utility of these consequences to the agent. Ordinarily, obtaining such information requires effort, it being costly to acquire the raw data and costly to analyze the data for the ....
Shoham, Y., 1987. Nonmonotonic logics: meaning and utility, Proceedings of the Tenth International Joint Conference on Artificial Intelligence, 388-393.
....which is inconsistent, and so must be false, contravening (iv) 2 Given these four intuitive properties are inconsistent, it is interesting to consider which property different systems have given up. i) is given up in circumscription [ McCarthy, 1986 ] in any minimal model solution [ Shoham, 1987 ] and systems which require membership in all extensions [ McDermott and Doyle, 1980 ] This is because they want the expressiveness that property (iii) gives, they need property (ii) by their very nature, and always reject having inconsistent extensions or reducing to no models. ii) is given up ....
....the system if the proportion of exceptions does not have measure zero. In particular this system does not seem appropriate to represent birds fly , as it is not true there are infinitesimally few birds that don t fly. His semantics means accepting the convention view of defaults (section 4. 3) Shoham [ 1987 ] rejects the one step default property in his discussion on the lottery paradox. However his discussion indicates that we would not want to write such defaults, but explicitly rejects the view of defaults as autoepistemic statements (section 4.3) Rather than indicating to the user that the ....
[Article contains additional citation context not shown here]
Y. Shoham, "Nonmonotonic Logics: Meaning and Utility", Proc. IJCAI-87, pp. 388-393.
....most influential work can be seen as a reified approach [80, 4, 63, 24] although it is not completely clear what the underlying logic is because, although their formulate their logics as a many sorted first order one, no one provides a special formal semantics for their temporal features. Shoham [103] is an exception. He presents a formally defined reified logic and sets out that it is more general than McDermott and Allen systems. It is interesting to have a look in detail at Shoham s formalization. Let s see the first order case: Syntactically it has a vocabulary similar to a Temporal ....
Y. Shoham. Nonmonotonic logics: Meaning and utility. In Proc. IJCAI'87, pages 388--393, 1987.
....of nonmonotonic reasoning based on the use of a modal operator have been proposed in [13, 15] The knowledge of an agent is characterized in terms of a fixed point equation that expresses its introspective capabilities. A different approach for defining nonmonotonic modal logics was taken in [3, 22, 7], where the knowledge of the agent is characterized on a semantic ground, following the idea of selecting those models in which knowledge is minimal. Recently, there have been a number of attempts to reconcile the fixed point and semantic characterizations of modal nonmonotonic logics. In order to ....
.... the minimization of objective facts, or, in other terms, to study the family of ground logics, for which we find an appropriate semantic characterization, that has been advocated in [21] In particular, the characterization we present is an instance of the preference semantics introduced by Shoham [22], where the preference criterion is given by a partial ordering over possible world models. We show the correspondence between such semantic characterization 1 A more recent version of this work [8] contains a technical difference which makes the resulting logic a logic of minimal belief , that ....
[Article contains additional citation context not shown here]
Y. Shoham. Nonmonotonic logics: meaning and utility. In Proc. of the 10th Int. Joint Conf. on Artificial Intelligence IJCAI-87, Milan, 1987.
....we can consider an S5 model as a set of propositional interpretations, i.e. a universal S5 model [20, Theorem 7.52] M 0 , if M 0 contains all the interpretations of M then M 0 6j= Sigma. Such a semantics gives to the modal operator K of the logic S5G a minimal knowledge interpretation [12, 27], which is very similar to the minimal belief interpretation of the MBNF operator B. Indeed, it is easy to see that, for positive subjective MBNF theories, there is a one to one correspondence between MBNF models of a theory Sigma and S5G models of the theory Sigma K , which is the theory ....
Y. Shoham. Nonmonotonic logics: Meaning and utility. In Proc. of IJCAI-87, pp. 388--392, 1987.
....able to provide a partial ordering relation on Kripke models. Definition 2.3 Given two Kripke models M 1 , M 2 , M 2 G M 1 if there exists a Kripke model M such that M 2 oe G M fi M 1 . Minimal models are characterized using the G ordering, as a special case of Shoham s preference semantics [Sho87] Definition 2.4 Given a normal modal logic S characterized by the class of Kripke models C, a model M 2 C is a ground C minimal model for I if M j= I and for every model M 0 2 C such that M 0 j= I, M 0 6 G M. Finally, we state the equivalence between the fix point and semantic ....
Y. Shoham. Nonmonotonic logics: meaning and utility. In Proc. of IJCAI87, pages 388--392, 1987.
....in a more abstract way, and look at the space of all possible default semantics. We can classify them by means of the valid deduction rules (and other properties, such as the preservation of consistency) There is a rich literature on nonmonotonic consequence relations (e.g. Gabbay, 1985; Shoham, 1987; Makinson, 1989; Kraus et al. 1990; Brass, 1990; Dix, 1991; Makinson, 1992 ] but our way of deriving a default semantics from given properties seems to be novel. Of course, the soundness of certain deduction rules has been proved or disproved for the known default semantics. The aim of this ....
Yoav Shoham. Nonmonotonic logics: Meaning and utility. In Proc. 10th International Joint Conference on Artificial Intelligence (IJCAI), pages 388--393, Milan, 1987. Our papers are available from the anonymous ftp-server "wega.informatik.uni-hannover.de" (130.75.26.1).
.... the modality K coincides with the epistemic operator of the modal logic defined by Halpern and Moses in [ Halpern Moses, 1985 ] also known as ground nonmonotonic modal logic S5G [ Donini, Nardi, Rosati, 1997b ] which modifies modal logic S5 through a very intuitive preference semantics [ Shoham, 1987 ] consider only the models of the knowledge base (i.e. the epistemic states of the agent modeled) in which the knowledge on the objective facts is minimal (i.e. the ignorance of the agent is maximal) The operator not can be considered as a generalization of the negation as failure operator ....
Y. Shoham. Nonmonotonic logics: Meaning and utility. In Proc. of IJCAI-87, pp. 388--392, 1987.
No context found.
Shoham, Y.: Nonmonotonic Logics: Meaning and Utility, In: J. McDermott (ed.), Proc. 10th International Joint Conference on Artificial Intelligence, IJCAI-87, Morgan Kaufmann, 1987, pp. 388-393
No context found.
Shoham, Y. 1987. Nonmonotonic logics: Meaning and utility. In Proc. of the 10th Int. Joint Conf. on Artificial Intelligence (IJCAI'87), 388--392.
No context found.
Y. Shoham. Nonmonotonic logics: meaning and utility. In: Proc. 10th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 388--393, 1987.
No context found.
Y. Shoham. Nonmonotonic logics: meaning and utility. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 388--393, 1987.
No context found.
Yoav Shoham. Nonmonotonic logic: meaning and utility. In Proc. of AAAI-87, pages 388--393, 1987. 66
No context found.
Shoham, Yoav, 1987. "Nonmonotonic Logics: Meaning and Utility", Proceedings, International Joint Conference on Artificial Intelligence, pp. 388--393. Milano, Italy, August 1987.
No context found.
Y. Shoham, Nonmonotonic Logics: Meaning and Utility, In: J. McDermott (ed.), Proc. 10th International Joint Conference on Artificial Intelligence, IJCAI-87, Morgan Kaufmann, 1987, pp.388-393
First 50 documents
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