Skip to main content

Towards Causality-Based Conflict Resolution in Answer Set Programs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2022)

Abstract

Using answer set programming in real-world applications requires that the answer set program is correct and adequately represents knowledge. In this paper, we present strategies to resolve unintended contradictory statements resulting from modelling gaps and other flaws by modifying the program without manipulating the actual conflicting rules (inconsistency-causing rules with complementary head literals). We show how latent conflicts can be detected to prevent further conflicts during the resolution process or after subsequent modifications in the future. The presented approach is another step towards a general framework where professional experts who are not necessarily familiar with ASP can repair existing answer set programs and independently resolve conflicts resulting from contradictory statements in an informative way. In such a framework, conflict resolution strategies allow for generating possible solutions that consist of informative extensions and modifications of the program. In interaction with the professional expert, these solution options can then be used to obtain the solution that represents the underlying knowledge best.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    Note that literals are classified as derivable once they appear in a pre-answer set and not only in a (classical) answer set.

References

  1. Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.C.: Dynamic logic programming. In: Freire-Nistal, J.L., Falaschi, M., Ferro, M.V. (eds.) 1998 Joint Conference on Declarative Programming, APPIA-GULP-PRODE 1998, A Coruña, Spain, 20–23 July 1998, pp. 393–408 (1998)

    Google Scholar 

  2. Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theory Pract. Log. Program. 2, 711–767 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fichte, J.K., Gaggl, S.A., Rusovac, D.: Rushing and strolling among answer sets - navigation made easy. CoRR abs/2112.07596 (2021)

    Google Scholar 

  4. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2012)

    Google Scholar 

  5. Gebser, M., Pührer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: Fox, D., Gomes, C.P. (eds.) Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, 13–17 July 2008, pp. 448–453. AAAI Press (2008)

    Google Scholar 

  6. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)

    Article  MATH  Google Scholar 

  7. Oetsch, J., Pührer, J., Tompits, H.: Stepwise debugging of answer-set programs. Theory Pract. Log. Program. 18(1), 30–80 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shchekotykhin, K.M.: Interactive query-based debugging of ASP programs. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25–30 January 2015, Austin, Texas, USA, pp. 1597–1603. AAAI Press (2015)

    Google Scholar 

  9. Thevapalan, A., Heyninck, J., Kern-Isberner, G.: Establish coherence in logic programs modelling expert knowledge via argumentation. In: Workshop on Causal Reasoning and Explanation in Logic Programming (CAUSAL 2021) (2021)

    Google Scholar 

  10. Thevapalan, A., Kern-Isberner, G.: Towards interactive conflict resolution in ASP programs. In: Martínez, M.V., Varzinczak, I. (eds.) Proceedings of the 18th International Workshop on Non-Monotonic Reasoning, NMR 2020, pp. 29–36, September 2020

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andre Thevapalan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Thevapalan, A., Haupt, K., Kern-Isberner, G. (2022). Towards Causality-Based Conflict Resolution in Answer Set Programs. In: Gottlob, G., Inclezan, D., Maratea, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2022. Lecture Notes in Computer Science(), vol 13416. Springer, Cham. https://doi.org/10.1007/978-3-031-15707-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15707-3_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15706-6

  • Online ISBN: 978-3-031-15707-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics