Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On Supporting Strong and Default Negation in Answer-Set Program Updates

  • Conference paper
  • First Online:
Advances in Artificial Intelligence -- IBERAMIA 2014 (IBERAMIA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8864))

Included in the following conference series:

Abstract

Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong negation by means of a syntactic transformation.

In this paper we pinpoint the limitations of both these approaches and argue that both types of negation should be first-class citizens in the context of updates. We identify principles that plausibly constrain their interaction but are not simultaneously satisfied by any existing rule update semantics. Then we extend one of the most advanced semantics with direct support for strong negation and show that it satisfies the outlined principles as well as a variety of other desirable properties.

J. Leite and M. Slota were partially supported by FCT under project PTDC/EIA-CCO/121823/2010. The collaboration between the co-authors resulted from the Slovak–Portuguese bilateral project supported by APVV agency under SK-PT-0028-10 and by FCT under FCT/2487/3/6/2011/S.

A preliminary version of this paper appeared as [1]. An extended version of this paper with all the proofs is available at http://arxiv.org/abs/1404.6784

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Slota, M., Baláž, M., Leite, J.: On strong and default negation in logic program updates. In: Procs. of NMR 2014. INFSYS Research Report Series, vol. 1843–14-01, pp. 73–81. TU Wien (2014)

    Google Scholar 

  2. Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Sci. Am. 284(5), 28–37 (2001)

    Article  Google Scholar 

  3. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Procs. of ICLP 1988, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  4. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3–4), 365–385 (1991)

    Article  Google Scholar 

  5. 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 

  6. Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.C.: Dynamic logic programming. In: Procs. of KR 1998, pp. 98–111. Morgan Kaufmann (1998)

    Google Scholar 

  7. Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.C.: Dynamic updates of non-monotonic knowledge bases. The Journal of Logic Programming 45(1–3), 43–70 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming (TPLP) 2(6), 721–777 (2002)

    Google Scholar 

  9. Leite, J.A.: Evolving Knowledge Bases, vol. 81. Frontiers of Artificial Intelligence and Applications. IOS Press (2003)

    Google Scholar 

  10. Sakama, C., Inoue, K.: An abductive framework for computing knowledge base updates. Theory and Practice of Logic Programming (TPLP) 3(6), 671–713 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Alferes, J.J., Banti, F., Brogi, A., Leite, J.A.: The refined extension principle for semantics of dynamic logic programming. Stud. Logica. 79(1), 7–32 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Banti, F., Alferes, J.J., Brogi, A., Hitzler, P.: The Well Supported Semantics for Multidimensional Dynamic Logic Programs. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 356–368. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Zhang, Y.: Logic program-based updates. ACM Transactions on Computational Logic 7(3), 421–472 (2006)

    Article  MathSciNet  Google Scholar 

  14. Šefránek, J.: Irrelevant Updates and Nonmonotonic Assumptions. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 426–438. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Delgrande, J.P., Schaub, T., Tompits, H.: A Preference-Based Framework for Updating Logic Programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 71–83. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Osorio, M., Cuevas, V.: Updates in answer set programming: An approach based on basic structural properties. Theory and Practice of Logic Programming 7(4), 451–479 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  17. Šefránek, J.: Static and dynamic semantics: Preliminary report. In: Procs. of MICAI 2011, pp. 36–42 (2011)

    Google Scholar 

  18. Krümpelmann, P.: Dependency semantics for sequences of extended logic programs. Logic Journal of the IGPL 20(5), 943–966 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  19. Alferes, J.J., Pereira, L.M.: Update-programs can update programs. In: Dix, J., Pereira, L.M., Przymusinski, T. C. (eds.) Procs. of NMELP 1996. LNCS, vol. 1216, 110–131. Springer, Heidelberg (1996)

    Google Scholar 

  20. Fages, F.: A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing 9(3/4), 425–444 (1991)

    Article  Google Scholar 

  21. Keller, A.M., Winslett, M.: On the use of an extended relational model to handle changing incomplete information. IEEE Trans. Software Eng. 11(7), 620–633 (1985)

    Article  Google Scholar 

  22. Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In: Procs. of KR 1991, pp. 387–394. Morgan Kaufmann Publishers (1991)

    Google Scholar 

  23. Herzig, A., Rifi, O.: Propositional belief base update and minimal change. Artif. Intell. 115(1), 107–138 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. Apt, K.R., Bezem, M.: Acyclic programs. New Generation Computing 9(3/4), 335–364 (1991)

    Article  Google Scholar 

  25. Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: A model-theoretic approach to belief change in answer set programming. ACM Transactions on Computational Logic (TOCL) 14(2), 14:1–14:46 (2013)

    Google Scholar 

  26. Slota, M., Leite, J.: The rise and fall of semantic rule updates based on se-models. Theory and Practice of Logic Programming FirstView, 1–39 (January 2014)

    Google Scholar 

  27. Slota, M., Leite, J.: Robust equivalence models for semantic updates of answer-set programs. In: Procs. of KR 2012, pp, 158–168. AAAI Press (2012)

    Google Scholar 

  28. Slota, M., Leite, J.: On semantic update operators for answer-set programs. In: Procs. of ECAI 2010. Frontiers in Artificial Intelligence and Applications, vol. 215, 957–962. IOS Press (2010)

    Google Scholar 

  29. Slota, M., Leite, J.: On condensing a sequence of updates in answer-set programming. In: Procs. of IJCAI 2013. IJCAI/AAAI (2013)

    Google Scholar 

  30. Slota, M., Leite, J.: A Unifying Perspective on Knowledge Updates. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 372–384. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CENTRIA and Departamento de Informática, Universidade Nova de Lisboa, Lisbon, Portugal

    Martin Slota & João Leite

  2. Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava, Slovakia

    Martin Baláž

Authors
  1. Martin Slota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Baláž
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. João Leite
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to João Leite .

Editor information

Editors and Affiliations

  1. Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Ana L.C. Bazzan

  2. Pontifica Universidad Católica (PUC), Santiago de Chile, Chile

    Karim Pichara

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Slota, M., Baláž, M., Leite, J. (2014). On Supporting Strong and Default Negation in Answer-Set Program Updates. In: Bazzan, A., Pichara, K. (eds) Advances in Artificial Intelligence -- IBERAMIA 2014. IBERAMIA 2014. Lecture Notes in Computer Science(), vol 8864. Springer, Cham. https://doi.org/10.1007/978-3-319-12027-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12027-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12026-3

  • Online ISBN: 978-3-319-12027-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation