TY - CONF
T1 - Mixing a default rule with stable negation
T2 - Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics
Y1 - 1996
A1 - Minker, Jack
A1 - Ruiz,C.
AB - 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.
JA - Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics
ER -