TU/e Research Portal · 2004 · 25 citations · 14 references
ComputingComputer ScienceDatabasesKnowledge RepresentationLogicNon-classical LogicPredicate LogicRelational Data ModelKnowledge Representation ModelingPropositional Knowledge RepresentationPropositional RepresentationResource Description FrameworkResource Description LanguagesTruth Gaps
The concept of negation plays a special role in non-classical logics and also in knowledge representation formalisms where negative information has to be taken into account on par with positive information. In the tradition of mathematical logic, there is a general preference to consider positive information as basic and treat negative information as derived. This has also been the approach in relational databases, in normal logic programs, and is now again the approach in the Resource Description Framework (RDF) that has recently been proposed as a general language for representing propositional information on the Web by the World Wide Web Committee (W3C). However, as we argue in this article, any practical knowledge representation formalism, especially for the Web, has to be able to deal with knowledge items involving partial predicates for which negative information is as informative as positive information, and which may have truth-value gaps and truth-value clashes. This kind of knowledge is best represented and processed with the help of the two negations of partial logic, one expressing explicit falsity and the other one expressing non-truth.
14
The stable model semantics for logic programming
Michael Gelfond, Vladimir Lifschitz · 1988 · 3.4K citations
The well-founded semantics for general logic programs
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf · Journal of the ACM · 1991 · 1.7K citations
The alternating fixpoint of logic programs with negation
Allen Van Gelder · 1989 · 372 citations · Full text