Revision Programs with Explicit Negation | SpringerLink
Skip to main content
Springer Nature Link
Log in

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:

  • 471 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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

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

  1. Department of Computer Science, Guizhou University, Guiyang, Guizhou, 550025, P. R. China

    Yisong Wang

  2. Guizhou Academy of Sciences, 40 East Yanan Road, Guiyang, Guizhou, 550001, P. R. China

    Mingyi Zhang

Authors
  1. Yisong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingyi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute of Software Technology, United Nations University, Macau, China

    Zhiming Liu

  2. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

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

Search

Navigation