Abstract
This paper is about the logical properties of sentences of the form S's are normally P, and starts from the idea that any logical theory for such sentences should meet the following simple requirement: We investigate how this requirement can be met by theories developed within the framework of circumscription, and specify a constraint – the exemption principle – that must be satisfied to do so. This principle determines in cases of conflicting default rules which objects are exempted from which rules, and, as such, is the main source for the capricious logical behavior of the sentences we are interested in.To facilitate comparison (and implementation) we supply an algorithm for inheritance networks and prove that arguments that can be expressed in both frameworks are valid on the circumscriptive account if and only if the inheritance algorithm has a positive outcome.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
