Premium
Conservative extension concepts for nonmonotonic knowledge bases
Author(s) -
Antoniou G.,
MacNish C. K.
Publication year - 2000
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/1098-111x(200009)15:9<859::aid-int3>3.0.co;2-e
Subject(s) - extension (predicate logic) , computer science , conservative extension , non monotonic logic , transparency (behavior) , belief revision , context (archaeology) , logical framework , deductive reasoning , automated reasoning , soundness , theoretical computer science , artificial intelligence , programming language , paleontology , computer security , biology
Conservative extensions of logical theories play an important role in software engineering. They provide a formal basis for program refinement and guarantee the integrity and transparency of modules and objects. This paper provides a detailed analysis of conservative extension concepts in the context of nonmonotonic knowledge bases, in particular default theories. Since there are different approaches to nonmonotonic reasoning based on different strategies for dealing with multiple extensions, we define several alternative refinement concepts and study their interrelationships. We also show that refinement is well behaved with respect to strong stratification, a technique for reducing computational effort in default reasoning. © 2000 John Wiley & Sons, Inc.