Web Rules Need Two Kinds of Negation

@inproceedings{Wagner2003WebRN,
  title={Web Rules Need Two Kinds of Negation},
  author={Gerd Wagner},
  booktitle={PPSWR},
  year={2003}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 50 CITATIONS

On querying simple conceptual graphs with negation

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A sufficient condition to guarantee the existence of fuzzy stable models on residuated logic programming with constrains

  • 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Negation in SPARQL

VIEW 1 EXCERPT
CITES RESULTS

FILTER CITATIONS BY YEAR

2004
2018

CITATION STATISTICS

  • 1 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

How to design a general rule markup language? In Proceedings of the First Workshop on XML Technologies for the Semantic Web (XSW2002), Lecture Notes in Informatics, Berlin

Gerd Wagner
  • Gesellschaft fr Informatik. invited paper
  • 2002

Experience and Theory

S. Koerner
  • Kegan Paul,
  • 1966