Checking identities is computationally intractable NP-hard and therefore human provers will always be needed.
https://doi.org/10.1002/int.10149
@article{DBLP:journals/ijis/KreinovichT04,
author = {Vladik Kreinovich and
Chin{-}Wang Tao},
title = {Checking identities is computationally intractable NP-hard and therefore
human provers will always be needed},
journal = {Int. J. Intell. Syst.},
volume = {19},
number = {1-2},
pages = {39--49},
year = {2004},
url = {https://doi.org/10.1002/int.10149},
doi = {10.1002/int.10149},
timestamp = {Sat, 27 May 2017 14:24:04 +0200},
biburl = {https://dblp.org/rec/journals/ijis/KreinovichT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签