Skip to Main content Skip to Navigation

Non-monotonic reasoning: from complexity to algorithms

Abstract : The purpose of this paper is to outline various results regarding the computational complexity and the algorithms of nonmonotonic entailment in different coherence-based approaches. Starting from a (non necessarily consistent) belief base E and a pre-order on E, we first remind different mechanisms for selecting preferred consistent subsets. Then we present different entailment principles in order to manage these multiple subsets. The crossing point of each generation mechanism m and each entailment principle p defines an entailment relation which we study from the computational complexity point of view. The results are not very encouraging since the complexity of all these nonmonotonic entailment relations is, in most restricted languages, larger than the complexity of monotonic entailment. Therefore, we decided to extend Binary Decision Diagrams techniques, which are well suited to the task of solving NP-hard logicbased problems. Both theoretical and experimental results are described along this line in the last sections.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Migration Prodinra <>
Submitted on : Thursday, September 3, 2020 - 4:01:47 PM
Last modification on : Thursday, June 10, 2021 - 3:48:48 AM
Long-term archiving on: : Friday, December 4, 2020 - 5:22:59 PM


Files produced by the author(s)


  • HAL Id : hal-02842327, version 1
  • PRODINRA : 135883


Claudette Cayrol, M.C. Lagasquie-Schiex, Thomas Schiex. Non-monotonic reasoning: from complexity to algorithms. Rapport IRIT--96.07R, IRIT - Institut de recherche en informatique de Toulouse; Toulouse 3 Paul Sabatier. 1996. ⟨hal-02842327⟩



Record views


Files downloads