Skip to main content
Journal Article

Web rules need two kinds of negation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2901 33-50
DOI: 10.1007/978-3-540-24572-8_3
50Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In natural language, and in some knowledge representation systems, such as extended logic programs, there are two kinds of negation: a weak negation expressing non-truth, and a strong negation expressing explicit falsity. In this paper I argue that, like in several basic computational languages, such as OCL and SQL, two kinds of negation are also needed for a Web rule language. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Wagner, G. (2003). Web rules need two kinds of negation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2901, 33–50. https://doi.org/10.1007/978-3-540-24572-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free