DMCA
Classical negation in logic programs and disjunctive databases (1991)
Cached
Download Links
- [ai.ustc.edu.cn]
- [cs.utep.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | New Generation Computing |
| Citations: | 1044 - 73 self |
BibTeX
@ARTICLE{Gelfond91classicalnegation,
author = {Michael Gelfond and Vladimir Lifschitz},
title = {Classical negation in logic programs and disjunctive databases},
journal = {New Generation Computing},
year = {1991}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic programs by including classical negation, in addition to negation-as-failure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter. 1
Keyphrases
classical negation disjunctive database logic program simple preprocessor important limitation special case classical logic traditional logic programming default theory extended program commonsense knowledge incomplete information similar way stable model logic programming general logic program knowledge representation tool
