A POLYNOMIAL ALGORITHM FOR AN ABDUCTION PROBLEM

A POLYNOMIAL ALGORITHM FOR AN ABDUCTION PROBLEMJ. Journal of Computer Research and Development, 1995, 32(6).

Citation:

A POLYNOMIAL ALGORITHM FOR AN ABDUCTION PROBLEMJ. Journal of Computer Research and Development, 1995, 32(6).

Citation:

A POLYNOMIAL ALGORITHM FOR AN ABDUCTION PROBLEMJ. Journal of Computer Research and Development, 1995, 32(6).

Abstract

In this paper, we offer one kind of incompatibility abduction problems──2SAT abduction problem, and prove it is tractable（P）. Meanwhile, it is extended to obtain the maximum tractable problem and the minimum NP-complete problem of incompatibility abduction problems.

FullText(HTML)

Turn off MathJax

Article Contents

Export File