Web rules need two kinds of negation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2901, Issue , 2003, Pages 33-50

  Wagner, Gerd ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

COMPUTATIONAL LANGUAGES; EXTENDED LOGIC; NATURAL LANGUAGES; STRONG NEGATIONS;

SEMANTIC WEB;

EID: 0346264771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24572-8_3     Document Type: Article

References (20)

1. Tim Berners-Lee. Reaching out onto the web. web document. http://www.w3.org/2000/10/swap/doc/Reach.
2. Harold Boley, Said Tabet, and Gerd Wagner. Design Rationale of RuleML: A Markup Language for Semantic Web Rules. In Proc. Semantic Web Working Symposium (SWWS'01). Stanford University, July/August 2001.
3. Stefan Decker, Mike Dean, and Deborah McGuinness. Requirements and use cases for a semantic web rule language. web document. http://www.isi.edu/stefan/rules/20030325/.
4. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Proc. of ICLP, pages 1070-1080. MIT Press, 1988.
5. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proc. of Int. Conf. on Logic Programming. MIT Press, 1990.
6. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
7. B.N. Grosof, Y. Labrou, and Hoi Y. Chan. A declarative approach to business rules in contracts: Courteous logic programs in XML. In Proc. 1st ACM Conference on Electronic Commerce (EC99), Denver, Colorado, USA, November 1999.
8. B.N. Grosof. Prioritized conflict handling for logic programs. In Jan Maluszynski, editor, Proc. of the Int. Symposium on Logic Programming (ILPS-97). MIT Press, 1997.
9. H. Herre, J. Jaspars, and G. Wagner. Partial logics with two kinds of negation as a foundation of knowledge-based reasoning. In D.M. Gabbay and H. Wansing, editors, What Is Negation? Oxford University Press, 1999.
10. H. Herre and G. Wagner. Stable models are generated by a stable chain. J. of Logic Programming, 30(2):165-177, 1997.
11. S. Koerner. Experience and Theory. Kegan Paul, London, 1966.
12. Jim Melton and Alan R. Simon. SQL:1999. Morgan Kaufmann, San Francisco, CA, 2002.
13. Luìs Moniz Pereira and José Jùlio Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, Proceedings of the European Conference on Artificial Intelligence (ECAI), pages 102-106. Wiley, 1992.
14. D. Pearce. Stable inference as intuitionistic validity. Journal of Logic Programming, 38:79-91, 1999.
15. D. Pearce and G. Wagner. Reasoning with negative information I - strong negation in logic programs. In M. Kusch L. Haaparanta and I. Niiniluoto, editors, Language, Knowledge and Intentionality. Acta Philosophica Fennica 49, 1990.
16. R. Reiter. On closed-world databases. In J. Minker and H. Gallaire, editors, Logic and Databases. Plenum Press, 1978.
17. A. van Gelder. Negation as failure using tight derivations for general logic programs. In Foundations of Deductive Databases and Logic Programming, pages 149-176. Morgan Kaufmann, San Mateo (CA), 1988.
18. G. Wagner. A database needs two kinds of negation. In B. Thalheim and H.-D. Gerhardt, editors, Proc. of the 3rd. Symp. on Mathematical Fundamentals of Database and Knowledge Base Systems, volume 495 of Lecture Notes in Computer Science, pages 357-371. Springer-Verlag, 1991.
19. G. Wagner. Foundations of Knowledge Systems - with Applications to Databases and Agents, volume 13 of Advances in Database Systems. Kluwer Academic Publishers, 1998. See http://www.inf.fu-berlin.de/∼wagnerg/ks.html.
20. Gerd Wagner. 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, June 2002. Gesellschaft für Informatik. invited paper.