1 - 9 of 9 Chapters
[Throughout, unless said otherwise, we will work in propositional logic.]
[Notation 2.1.1 We use sometimes FOL as abbreviation for first-order logic and NML for nonmonotonic logic.]
[We first introduce a generalized quantifier in a first-order setting, as this is very natural, and prepares the more abstract discussion to come.]
[This chapter, Preferential structures – Part I, is dedicated to the basic case without conditions for the domain. The following chapter, Part II, see Chap. 5 (p. 158), will treat the case with supplementary conditions for the domain, as well as applications and special cases.Higher preferential...
[We examine here simplifications made possible by stronger closure conditions of the domain Y, in particular (∪) .]
[Definition 6.1.1 An IBR is called a generalized pref erential structure iff the origins of all arrows are points.]
[The material in this section is taken from [GS08f].]
[We will treat here problems due to lack of information, i.e. we can “see” some dimensions, but not all.]
[The material in this chapter is taken from [GS08e].]
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.