%0 Conference Paper
%B Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics
%D 1996
%T Mixing a default rule with stable negation
%A Minker, Jack
%A Ruiz,C.
%X Logic programs containing only at most one form ofdefault negation have been studied in the literature. We describe a class of logic programs containing multi- ple forms of default negation. We de ne a meaning for these programs based on the well{founded semantics and the stable semantics. We investigate properties of the new combined semantics and calculate the com- putational complexity of determining the existence of models, and of skeptical and credulous reasoning. An e ective procedure to construct the collection of mod- els characterizing the semantics of a program is given. Applications to knowledge representation and knowl- edge base merging are presented.
%B Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics
%P 122 - 125
%8 1996///
%G eng