Skip to main content
SpringerLink
Log in

Anytime argumentative and abductive reasoning

  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This article presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm can be interrupted at any time returning the solution found so far. The quality of the approximation increases monotonically when more computational resources are available. The method is based on cost functions and returns lower and upper bounds.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Center for Junior Research Fellows, University of Konstanz, Germany

    R. Haenni

  2. University of Konstanz, Schützenstrasse 10, CH-8280, Kreuzlingen, Switzerland

    R. Haenni

Authors
  1. R. Haenni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Haenni.

Additional information

Research supported by (1) Alexander von Humboldt Foundation, (2) German Federal Ministry of Education and Research, (3) German Program for the Investment in the future.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haenni, R. Anytime argumentative and abductive reasoning. Soft Computing 8, 142–149 (2003). https://doi.org/10.1007/s00500-002-0254-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-002-0254-y

Keywords

Search

Navigation