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...
%0 Journal Article
%1 Gelfond91
%A Gelfond, Michael
%A Lifschitz, Vladimir
%D 1991
%J New Generation Computing
%K disjunctive-database, logic-programming, negation
%N 3/4
%P 365--386
%T Classical Negation in Logic Programs and Disjunctive Databases
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7150
%V 9
%X 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...
@article{Gelfond91,
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...}},
added-at = {2011-05-04T16:04:17.000+0200},
author = {Gelfond, Michael and Lifschitz, Vladimir},
biburl = {https://www.bibsonomy.org/bibtex/2cd6725cdbd28087291599d70807c60ba/baisemain},
citeulike-article-id = {326528},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7150},
interhash = {efa3e7a8d1811a2d94892129c3582a47},
intrahash = {cd6725cdbd28087291599d70807c60ba},
journal = {New Generation Computing},
keywords = {disjunctive-database, logic-programming, negation},
number = {3/4},
pages = {365--386},
posted-at = {2007-11-01 17:51:25},
priority = {2},
timestamp = {2011-05-04T16:04:37.000+0200},
title = {{Classical Negation in Logic Programs and Disjunctive Databases}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7150},
volume = 9,
year = 1991
}