Abstract
We present a model for deductive object oriented query languages with inheritance and overriding. In this model, we consider a DAG like dynamic isa hierarchy and we account for both value or attribute inheritance and method inheritance or code sharing. We show that these two types of inheritance can be treated uniformly within an elegant declarative setting. We then propose a novel semantics for the non-monotonic behavior resulting from the combination of overriding, dynamic selfbinding and the dynamic structure of the isa hierarchy. This semantics is reminiscent of the stable model semantics of logic programs with negation. We also isolate a syntactic condition that guarantees the existence of a unique stable model for a program. This condition, in its turn, is inspired by the local stratification condition of perfect model semantics for programs with negation. Finally we define a bottom-up procedure that computes the unique stable model of a stratified program.KeywordsLogic ProgramLogic ProgrammingStable ModelUnit ClauseStable Model SemanticThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
