| D. Makinson (1994) `General patterns in nonmonotonic reasoning'. In Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3, Clarendon Press, Oxford: 35--110. |
.... Others were based on preferences between the truth values that are assigned to formulas (see e.g. Kifer and Lozinskii, 1992; Arieli and Avron, 2000a] Preferential systems were also used for providing semantics for nonmonotonic consequence relations (see e.g. Shoham, 1987; Kraus et al. 1990; Makinson, 1994] It was discovered, however, that in order for them to fulfill all the desired theoretical properties that plausible nonmonotonic relations should have (see e.g. Lehmann, 1992] preferential systems need to satisfy a further condition called stopperedness or smoothness. The problem is that ....
....study of general patterns for nonmonotonic reasoning. The basic idea behind most of the works is to classify nonmonotonic formalisms and to recognize logical properties that they should satisfy. Some works continued to study the properties of nonmonotonic relations as independent relations, e.g. [Makinson, 1994] and [Lehmann, 1992] The latter suggested the concept of a plausibility logic. Other works based the nonmonotonic consequence relations j on underlying monotonic ones . At first ( Kraus et al. 1990] the nonmonotonic relations were in the classical propositional language and were based on ....
[Article contains additional citation context not shown here]
D. Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Inelligence and Logic Programming, volume 3, pages 35--110. Oxford Science Pub., 1994.
....terminology in this context was first introduced by Touretzky et al. 15] but the distinction itself is older than this; it was already implicit in Reiter s paper on default logic, and was described explicitly by McDermott [10] as the distinction between brave and cautious reasoning. Makinson [8] refers to the first of the two credulous options described here as the choice option. could indeed be codified as a consequence relation, but it would be a peculiar one. According to this policy, the conclusion set associated with a default theory need not be closed under standard logical ....
David Makinson. General patterns in nonmonotonic reasoning. In D. Gabbay, C.Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning, pages 35--110. Oxford University Press, 1994. 21
....by sets, epistemic entrenchment, rational consequence. Introduction and preliminaries The methodological connections between the areas of nonmonotonic reasoning, i.e. the process by which an agent may, possibly, withdraw previously derived conclusions upon enlarging her set of hypotheses ( Mak 94] and belief revision, i.e. the process by which an agent changes her beliefs upon discovering some new information ( AGM 85, Gar 88] are well known (see, for example, GM 94, GR 95, MG 90, Rot 96] As a consequence, it is possible to translate particular problems in one area into problems ....
D. Makinson, General patterns in nonmonotonic reasoning, in: D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning, Oxford University Press, (1994) 35-- 110.
.... literals (i.e. literals that may be preceded by not) The complement of a literal l is denoted by l (that is, if l =p for some atom p then l = p, and if l = p then l =p) As usual in the context of logic programming, we shall deal with formulae in a clausal form, as de ned below: See, e.g. [5,6,11,12,32,34,39] for some non classical methods for reasoning with partial or contradictory information. De nition 2.1. Let n m 0. A positive clause is a formula of the form p p 1 ; p n A standard clause is a formula of the form p p 1 ; p m ; not p m 1 ; not p n A normal ....
D.Makinson, General patterns in nonmonotonic reasoning, in: Handbook of Logic in Arti cial Intelligence and Logic Programming 3, eds. D.Gabbay, C.Hogger and J.Robinson, Oxford Science Publications, 1994, pp. 35-110.
....programming semantics as nonmonotonic inference. The general theory of nonmonotonic inference and a classi cation of properties of nonmonotonic operators was developed by Kraus, Lehmann, and Magidor [KLM90] leading to the notion KLM axioms for these properties, and developed further by Makinson [Mak94]. These axioms were adopted to the terminology of logic programming and extended to a general theory of logic programming semantics by Dix [Dix95a, Dix95b] In this framework, di erent known semantics are classi ed according to strong properties the KLM axioms which hold for the semantics and ....
David Makinson. General patterns of nonmonotonic reasoning. In Dov M. Gabbay, Christopher J. Hogger, and J. Alan Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, Vol. 2, Nonmonotonic and Uncertain Reasoning. Oxford University Press, 1994.
....Logics fail, in general, to satisfy two of the properties assumed there, representation results for larger families than those of [7] are needed. Such results will be developed rst. For the conservative extension results to be proven below, models closer to the cumulative models of [6] or of [8] could have been used. The models presented here and their tight link with the failure of Coherence have been preferred both for their intrinsic interest and for compatibility with [7] 1.1 Re ections on this paper The study of C logics is unexpectedly smooth and attractive. The basic intuition ....
David Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, volume 3, Nonmonotonic and Uncertain Reasoning, pages 35-110. Oxford University Press, 1994. 20
....Monotonicity is required. Cautious Monotonicity 8A; B L A B C(A) C(A) C(B) Cautious Monotonicity is a restricted form of Monotonicity: any monotonic operation is cautiously monotonic. This property was rst introduced by D. Gabbay [16] in its nitary form and by D. Makinson [24, 25] in its in nitary form. It requires that one does not retract previous conclusions when one learns that a previous conclusion is indeed true. It seems to have been accepted as reasonable by all researchers in the eld. A discussion of its appeal may be found in [19] The next two properties are ....
....accepted as reasonable by all researchers in the eld. A discussion of its appeal may be found in [19] The next two properties are described here for the rst time, but they are closely related to the property previously discussed under the name of Deductivity or In nite Conditionalization in [11, 12, 9, 13, 25, 18]. The rst one, termed Conditional Monotonicity, expresses the requirement that C behave monotonically if one replaces, in the assumptions, some of the assumptions by their consequences. It asserts that non monotonicity cannot be caused by the deduction process itself. It is only the addition of ....
[Article contains additional citation context not shown here]
David Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, volume 3, Nonmonotonic and Uncertain Reasoning, pages 35-110. Oxford University Press, 1994. 39
No context found.
D. Makinson (1994) `General patterns in nonmonotonic reasoning'. In Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3, Clarendon Press, Oxford: 35--110.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In D.Gabbay, C.Hogger, and J.Robinson, editors, Handbook of Logic in Art. Int. and Logic Prog., volume Nonmonotonic and Uncertain Reasoning, pages 35--110. Oxford University Press, 1994.
No context found.
Makinson, D.: General patterns in nonmonotonic reasoning. In D.Gabbay, C.Hogger, J.Robinson, eds.: Handbook of Logic in Art. Int. and Logic Prog. Volume Nonmonotonic and Uncertain Reasoning. Oxford University Press (1994) 35--110
No context found.
D. Makinson, General Patterns in Nonmonotonic Reasoning, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (eds) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic Reasoning, Oxford Science Publications, Oxford, 1994.
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In D.Gabbay, C.Hogger, and J.Robinson, editors, Handbook of Logic in Art. Int. and Logic Prog., volume Nonmonotonic and Uncertain Reasoning, pages 35--110. Oxford University Press, 1994.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In D.M. Gabbay, C.J.Hogger, and J.A.Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning. Oxford University Press, 1993. 19
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, volume 3, Nonmonotonic and Uncertain Reasoning, pages 35-110. Oxford University Press, 1994. 9
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In D. Gabbay, editor, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, 1993.
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, editor, Handbook of Logic in AI and Logic Programming: Nonmonotonic and Uncertain Reasoning, volume 2. Oxford, 1993.
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, pages 35--110. Oxford University Press, 1994.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 3, Nonmonotonic and Uncertain Reasoning, pages 35--110. Oxford University Press, 1994.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In Handbook of Logic in AI and Logic Programming, volume 2. Oxford University Press, 1991. To appear.
No context found.
D. Makinson. General patterns in non-monotonic reasoning. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 3. D. Gabbay, C. Hogger, and J. Robinson, eds. Oxford University Press, 1994.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In Handbook of Logic in AI and Logic Programming, volume 2. Oxford University Press, 1991. To appear.
No context found.
David Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 3, Nonmonotonic and Uncertain Reasoning, pages 35--110. Oxford University Press, 1994.
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In Dov Gabbay, Christopher J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Arti cial Intelligence and Logic Programming, Volume 3: Nonmonotonic and Uncertain Reasoning, pages 35-111. Oxford University Press, Oxford, 1994.
No context found.
D. Makinson. General patterns in nonmonotonic reasoning. In D.M. Gabbay, C.J.Hogger, and J.A.Robinson, editors, The Handbook on Logic in AI and Logic Programming, volume 3, pp 35-110, Oxford University Press, 1993
No context found.
D. Makinson, "General Patterns in Nonmonotonic Reasoning", in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford Science Publications, 1994, pp. 35-110.
First 50 documents Next 50
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