Skip to main content

Revision Programs with Explicit Negation

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2004 (ICTAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3407))

Included in the following conference series:

  • 445 Accesses

Abstract

Revision program [9], which describes the transformation from an initial database to a revised database, is a formalism for specifying revisions on database. In order to deal with the incompleteness of knowledge, the paper provides an extension for both database and revision program by introducing explicit negation. Motivated by ā€œ ~l ā†Ā¬lā€ [2], we propose an extended P-justified revision semantics for the extension, which is more general than P-justified revision semantics, where we argue that the latest knowledge is preferred to the old one when it conflicts with the old. This extension is not trivial by simply regarding negative literals as positive in annotated revision programs [10]. In the end, we establish the one-to-one correspondence between the extended P-justified revisions of extended revision programs and answer sets of the corresponding extended logic programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.: Dynamic logic programming. In: Cohn, A., Schubert, L. (eds.) KR 1998. Morgan Kaufmann, San Francisco (1998)

    Google ScholarĀ 

  2. Baral, C.: Embedding Revision Programs in Logic Programming Situation Calculus. JLPĀ 30(1), 83ā€“97 (1997)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  3. Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: A Framework for Declarative Update Specifications in Logic Programs. In: Proc. IJCAI 2001, pp. 649ā€“654 (2001)

    Google ScholarĀ 

  4. Gelfond, M., Lifschitz, V.: The Stable Semantics for Logic Programs. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the 5th International Symposium on Logic Programming, Cambridge, Ma, pp. 1070ā€“1080. MIT Press, Cambridge (1988)

    Google ScholarĀ 

  5. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. In: New Generation Computing, pp. 365ā€“387 (1991)

    Google ScholarĀ 

  6. Leite, J.A., Pereira, L.M.: Generalizing updates: From models to programs. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol.Ā 1471, pp. 224ā€“246. Springer, Heidelberg (1998)

    ChapterĀ  Google ScholarĀ 

  7. Leite, J.A., Pereira, L.M.: Iterated Logic Program Updates. In: Jaffar, J. (ed.) Procs. of the 1998 Joint International Conference and Symposium on Logic Programming (JICSLP 1998), Manchester, England, June 1998, pp. 265ā€“278. MIT Press, Cambridge (1998)

    Google ScholarĀ 

  8. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial IntelligenceĀ 25, 369ā€“389 (1999)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  9. Marek, V., Truszczński, M.: Revision Programming. Theoretical Computer Science (1998)

    Google ScholarĀ 

  10. Marek, V., Pivkina, I., Truszczński, M.: Annotated revision programs. Artificial IntelligenceĀ 138(1-2), 149ā€“180 (2002)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  11. Pereira, L.M., Alferes, J.J.: Well Founded Semantics for Logic Programs with Explicit Negation. In: Proc. Of European Conference on AI (1992)

    Google ScholarĀ 

  12. Pivkina, I.: Revision Program: A Knowledge Representation Formalism. Ph.D dissertation, at http://cs.engr.uky.edu/~inna/ (2001)

  13. Przymusinski, T., Turner, H.: Update by means of inference rules. Journal of Logic ProgrammingĀ 30(2), 125ā€“143 (1997)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  14. Reiter, R.: A logic for default reasoning. Artif. Intell.Ā 13(1-2), 81ā€“132 (1980)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  15. Mingyi, Z.: A New Research into Default Logic, Information and Computation 129(2) (September 15, 1996)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Zhang, M. (2005). Revision Programs with Explicit Negation. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31862-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25304-4

  • Online ISBN: 978-3-540-31862-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics