Skip to main content
Springer Nature Link
Log in

A Semantic Characterization for ASP Base Revision

  • Conference paper
  • First Online:
Scalable Uncertainty Management (SUM 2017)

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

Included in the following conference series:

Abstract

The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This characterization allows one to equivalently consider the evolution of syntactic logic programs and the evolution of their semantic content.

This work was supported by the project ASPIQ (ANR-12-BS02-0003).

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alchourrón, C.E., Makinson, D.: On the logic of theory change: safe contraction. Stud. Log. 44(4), 14–37 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  4. Benferhat, S., Bennaim, J., Papini, O., Würbel, E.: Answer set programming encoding of prioritized removed sets revision: application to GIS. Appl. Intell. 32, 60–87 (2010)

    Article  Google Scholar 

  5. Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proceedings of IJCAI 1993, pp. 640–645 (1993)

    Google Scholar 

  6. Delgrande, J., Peppas, P., Woltran, S.: AGM-style belief revision of logic programs under answer set semantics. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 264–276. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40564-8_27

    Chapter  Google Scholar 

  7. Delgrande, J.P., Schaub, T., Tompits, H., Woltran, S.: Belief revision of logic programs under answer set semantics. In: Proceedings of KR 2008, pp. 411–421 (2008)

    Google Scholar 

  8. Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: Merging logic programs under answer set semantics. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 160–174. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02846-5_17

    Chapter  Google Scholar 

  9. Delgrande, J.P., Schaub, T., Tompits, H., Woltran, S.: A model-theoretic approach to belief change in answer set programming. ACM Trans. Comput. Log. 14(2), 14:1–14:46 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. TPLP 2(6), 711–767 (2002)

    MathSciNet  MATH  Google Scholar 

  11. Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52–89 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  13. Hansson, S.O.: Semi-revision. J. Appl. Non-class. Log. 7, 151–175 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hansson, S.O.: A Text of Belief Dynamics: Theory Change and Database Updating. Springer, Netherlands (1999)

    Book  MATH  Google Scholar 

  15. Hué, J., Papini, O., Würbel, E.: Removed sets fusion: performing off the shelf. In: Proceedings of ECAI 2008, pp. 94–98 (2008)

    Google Scholar 

  16. Hué, J., Papini, O., Würbel, E.: Merging belief bases represented by logic programs. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 371–382. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02906-6_33

    Chapter  Google Scholar 

  17. Hué, J., Papini, O., Würbel, E.: Extending belief base change to logic programs with ASP. In: Trends in Belief Revision and Argumentation Dynamics. Studies in Logic, December 2013

    Google Scholar 

  18. Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Krümpelmann, P., Kern-Isberner, G.: Belief base change operations for answer set programming. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 294–306. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33353-8_23

    Chapter  Google Scholar 

  20. Lehmann, D.: Belief revision, revised. In: Proceedings of IJCAI 1995, pp. 1534–1540 (1995)

    Google Scholar 

  21. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. AMAI 25(3–4), 241–273 (1999)

    MathSciNet  MATH  Google Scholar 

  23. Papini, O.: A complete revision function in propositional calculus. In: Neumann, B. (ed.) Proceedings of ECAI 1992, pp. 339–343. Wiley (1992)

    Google Scholar 

  24. Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1–2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  25. Sakama, C., Inoue, K.: Updating extended logic programs through abduction. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS, vol. 1730, pp. 147–161. Springer, Heidelberg (1999). doi:10.1007/3-540-46767-X_11

    Chapter  Google Scholar 

  26. Schaub, T.: Here’s the beef: answer set programming!. In: Proceedings of ICLP 2008, pp. 93–98 (2008)

    Google Scholar 

  27. Slota, M., Leite, J.: On semantic update operators for answer-set programs. In: Proceedings of ECAI 2010, pp. 957–962 (2010)

    Google Scholar 

  28. Slota, M., Leite, J.: The rise and fall of semantic rule updates based on se-models. TPLP 14(6), 869–907 (2014)

    MathSciNet  MATH  Google Scholar 

  29. Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. TPLP 3, 609–622 (2003)

    MathSciNet  MATH  Google Scholar 

  30. Würbel, E., Jeansoulin, R., Papini, O.: Revision: an application in the framework of GIS. In: Proceedings of KR 2000, pp. 505–518 (2000)

    Google Scholar 

  31. Zhang, Y., Foo, N.Y.: Updating logic programs. In: Proceedings of ECAI 1998, pp. 403–407 (1998)

    Google Scholar 

  32. Zhuang, Z., Delgrande, J.P., Nayak, A.C., Sattar, A.: A new approach for revising logic programs. In: Proceedings of NMR 2016, pp. 171–176 (2016)

    Google Scholar 

  33. Zhuang, Z., Delgrande, J.P., Nayak, A.C., Sattar, A.: Reconsidering AGM-style belief revision in the context of logic programs. In: Proceedings of ECAI 2016, pp. 671–679 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA Universitè d’Angers, Angers, France

    Laurent Garcia, Claire Lefèvre & Igor Stéphan

  2. LSIS-CNRS UMR 7296, Aix-Marseille Universitè, Marseille, France

    Odile Papini & Éric Würbel

Authors
  1. Laurent Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claire Lefèvre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Odile Papini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Igor Stéphan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Éric Würbel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laurent Garcia .

Editor information

Editors and Affiliations

  1. University of Granada, Granada, Spain

    Serafín Moral

  2. University of Rennes I, Lannion, France

    Olivier Pivert

  3. University of Granada, Granada, Spain

    Daniel Sánchez

  4. University of Granada, Granada, Spain

    Nicolás Marín

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Garcia, L., Lefèvre, C., Papini, O., Stéphan, I., Würbel, É. (2017). A Semantic Characterization for ASP Base Revision. In: Moral, S., Pivert, O., Sánchez, D., Marín, N. (eds) Scalable Uncertainty Management. SUM 2017. Lecture Notes in Computer Science(), vol 10564. Springer, Cham. https://doi.org/10.1007/978-3-319-67582-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67582-4_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67581-7

  • Online ISBN: 978-3-319-67582-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics