Algorithms for computing minimal conflicts

Logic Journal of the IGPL 14 (2):391--406 (2006)
  Copy   BIBTEX

Abstract

In this paper we present some algorithms for computing minimal conflicts. First of all we discuss the relationship between minimal conflicts and minimally inconsistent subsets. Then we introduce an algorithm for computing all minimally inconsistent subsets, which is applied to generating all minimal conflicts. Furthermore, an algorithm for computing all minimal conflicts using structured description is introduced, and its correctness is proved; its time complexity is also shown. The algorithm using structured description terminates in polynomial time for some special system, such as the tree–structured systems. The algorithms are also complared with related works

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-19

Downloads
32 (#703,717)

6 months
8 (#575,465)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

A theory of diagnosis from first principles.Raymond Reiter - 1987 - Artificial Intelligence 32 (1):57-95.

Add more references