Skip to main content
SpringerLink
Log in

Early Recovery in Logic Program Updates

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)

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

  • 987 Accesses

Abstract

We pinpoint the limitations of existing approaches to the treatment of strong and default negation in answer-set program updates and formulate the early recovery principle that plausibly constrains their interaction.

M. Slota and J. Leite were supported by Fundação para a Ciência e a Tecnologia under project “ERRO - Efficient Reasoning with Rules and Ontologies” (PTDC/EIA-CCO/121823/2010). The collaboration between the co-authors resulted from the Slovak-Portuguese bilateral project “ReDIK - Reasoning with Dynamic Inconsistent Knowledge”, supported by the APVV agency under SK-PT0-0028-10 and by Fundação para a Ciência e a Tecnologia (FCT/2487/3/6/2011/S).

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

Access this chapter

Log in via an institution
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.

References

  1. Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American 284(5), 28–37 (2001)

    Article  Google Scholar 

  2. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the 5th International Conference and Symposium on Logic Programming, ICLP/SLP 1988, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

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

    Article  Google Scholar 

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

  5. 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  MathSciNet  MATH  Google Scholar 

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

  7. Leite, J.A.: Evolving Knowledge Bases. Frontiers of Artificial Intelligence and Applications, vol. 81, xviii + 307 p. Hardcover. IOS Press (2003)

    Google Scholar 

  8. 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  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MathSciNet  Google Scholar 

  12. Š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 

  13. 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  MathSciNet  MATH  Google Scholar 

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

  15. Šefránek, J.: Static and dynamic semantics: Preliminary report. In: Mexican International Conference on Artificial Intelligence, pp. 36–42 (2011)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  18. Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming 35(1), 39–78 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  20. Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In: Allen, J.F., Fikes, R., Sandewall, E. (eds.) Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, KR 1991, pp. 387–394. Morgan Kaufmann Publishers (1991)

    Google Scholar 

  21. Herzig, A., Rifi, O.: Propositional belief base update and minimal change. Artificial Intelligence 115(1), 107–138 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Slota, M., Leite, J.: Towards Closed World Reasoning in Dynamic Open Worlds. Theory and Practice of Logic Programming 10(4-6), 547–564 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  23. Slota, M., Leite, J., Swift, T.: Splitting and updating hybrid knowledge bases. Theory and Practice of Logic Programming 11(4-5), 801–819 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  24. Banti, F., Alferes, J.J., Brogi, A.: Well founded semantics for logic program updates. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 397–407. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Knorr, M., Alferes, J.J., Hitzler, P.: Local closed world reasoning with description logics under the well-founded semantics. Artificial Intelligence 175(9-10), 1528–1554 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  26. Gonçalves, R., Alferes, J.J.: Parametrized logic programming. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 182–194. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Martin Slota & João Leite

  2. Faculty of Mathematics, Physics and Informatics, Comenius University, 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

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Corunna, Campus de Elviña s/n, 15071, Corunna, Spain

    Pedro Cabalar

  2. Department of Computer Science, New Mexico State University, 1290 Frenger Mall, SH 123, MSC CS, P.O. Box 30001, 88003, Las Cruces, NM, USA

    Tran Cao Son

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slota, M., Baláž, M., Leite, J. (2013). Early Recovery in Logic Program Updates. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40564-8_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40563-1

  • Online ISBN: 978-3-642-40564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation