Loading...
Please wait, while we are loading the content...
Similar Documents
Mixing a Default Rule with Stable Negation (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Minker, Jack Ruiz, Carolina |
| Description | Logic programs containing only at most one form of default negation have been studied in the literature. We describe a class of logic programs containing multiple forms of default negation. We define 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 computational complexity of determining the existence of models, and of skeptical and credulous reasoning. An effective procedure to construct the collection of models characterizing the semantics of a program is given. Applications to knowledge representation and knowledge base merging are presented. Introduction Logic programming and non-monotonic reasoning have developed several theories for interpreting negated information and for deducing it from positive data. Two widely used semantics for default negation are the Well--Founded Semantics (WFS) (Van Gelder, Ross, & Schlipf 1988) and the stable semantics (Gelfond & Lifsch... |
| File Format | |
| Language | English |
| Publisher Date | 1996-01-01 |
| Publisher Institution | Proceedings of the Fourth International Symposium on Arti Intelligence and Mathematics |
| Access Restriction | Open |
| Subject Keyword | Introduction Logic Programming Multiple Form Stable Negation Gelfond Lifsch Well Founded Semantics Knowledge Base Merging Negated Information Van Gelder Effective Procedure Non-monotonic Reasoning Default Negation Stable Semantics Logic Program Several Theory New Combined Semantics Default Rule Credulous Reasoning Computational Complexity Positive Data |
| Content Type | Text |
| Resource Type | Article |