Abstract
The aim of this paper is to investigate two powerful methods of handling negative information in logic-based knowledge representation systems: the logical minimization in the form of circumscription and the negation as failure rule, formalized by various closures (or completions) of original theories. We suggest a new, more powerful form of the negation as failure rule and describe an important class of theories for which this form of negation as failure is equivalent to particular forms of circumscription. These results establish a close relationship between the two important formalizations of nonmonotonic reasoning and provide a syntactic characterization of the corresponding circumscriptive theories. This allows us to apply existing methods of deduction using various negation as failure rules to answering queries in a broad class of circumscriptive theories.
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.
