Premium
A note on the infeasibility of some inference processes
Author(s) -
Maung I.,
Paris J. B.
Publication year - 1990
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550050509
Subject(s) - inference , class (philosophy) , computer science , computational complexity theory , artificial intelligence , theoretical computer science , algorithm
We observe that it follows from currently held conjectures in computational complexity that a wide class of inference processes considered for reasoning about uncertainty in AI are computationally infeasible.