Skip to main content
SpringerLink
Log in

An Algorithm for the Contension Inconsistency Measure Using Reductions to Answer Set Programming

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

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

Included in the following conference series:

Abstract

We present an algorithm for determining inconsistency degrees wrt. the contension inconsistency measure [7] which utilizes three-valued logic to determine the minimal number of atoms that are assigned truth value B (paradoxical/both true and false). Our algorithm is based on an answer set programming encoding for checking for upper bounds and a binary search algorithm on top of that. We experimentally show that the new algorithm significantly outperforms the state of the art .

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 EPUB and 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

Notes

  1. 1.

    http://tweetyproject.org/api/1.14/net/sf/tweety/logics/pl/analysis/ContensionInconsistencyMeasure.html.

  2. 2.

    http://tweetyproject.org/index.html.

  3. 3.

    http://tweetyproject.org/api/1.14/net/sf/tweety/logics/pl/util/SyntacticRandomSampler.html.

References

  1. Atkinson, K., et al.: Toward artificial argumentation. AI Mag. 38(3), 25–36 (2017)

    Article  MathSciNet  Google Scholar 

  2. Béziau, J.Y., Carnielli, W., Gabbay, D. (eds.): Handbook of Paraconsistency. College Publications, London (2007)

    MATH  Google Scholar 

  3. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  4. De Bona, G., Grant, J., Hunter, A., Konieczny, S.: Towards a unified framework for syntactic inconsistency measures. In: Proceedings of the AAAI 2018 (2018)

    Google Scholar 

  5. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. Synth. Lect. Artif. Intell. Mach. Learn. 6(3), 1–238 (2012)

    Article  Google Scholar 

  6. Grant, J.: Classifications for inconsistent theories. Notre Dame J. Formal Logic 19(3), 435–444 (1978)

    Article  MathSciNet  Google Scholar 

  7. Grant, J., Hunter, A.: Measuring consistency gain and information loss in stepwise inconsistency resolution. In: Liu, W. (ed.) ECSQARU 2011. LNCS (LNAI), vol. 6717, pp. 362–373. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22152-1_31

    Chapter  MATH  Google Scholar 

  8. Grant, J., Martinez, M. (eds.): Measuring Inconsistency in Information. College Publications, London (2018)

    MATH  Google Scholar 

  9. Hansson, S.: A Textbook of Belief Dynamics. Kluwer Academic Publishers (2001)

    Google Scholar 

  10. Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: Proceedings of the KR 2008, pp. 358–366 (2008)

    Google Scholar 

  11. Priest, G.: Logic of paradox. J. Philos. Logic 8, 219–241 (1979)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Thimm, M.: Measuring inconsistency with many-valued logics. Int. J. Approximate Reasoning 86, 1–23 (2017)

    Article  MathSciNet  Google Scholar 

  14. Thimm, M.: On the evaluation of inconsistency measures. In: Measuring Inconsistency in Information. College Publications (2018)

    Google Scholar 

  15. Thimm, M., Wallner, J.: On the complexity of inconsistency measurement. Artif. Intell. 275, 411–456 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Koblenz-Landau, Koblenz, Germany

    Isabelle Kuhlmann & Matthias Thimm

Authors
  1. Isabelle Kuhlmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Thimm
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isabelle Kuhlmann .

Editor information

Editors and Affiliations

  1. KU Leuven, Heverlee, Belgium

    Jesse Davis

  2. Artois University, Lens, France

    Karim Tabia

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kuhlmann, I., Thimm, M. (2020). An Algorithm for the Contension Inconsistency Measure Using Reductions to Answer Set Programming. In: Davis, J., Tabia, K. (eds) Scalable Uncertainty Management. SUM 2020. Lecture Notes in Computer Science(), vol 12322. Springer, Cham. https://doi.org/10.1007/978-3-030-58449-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58449-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58448-1

  • Online ISBN: 978-3-030-58449-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation