A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
On the Complexity of Extending Ground Resolution with Symmetry Rules
1995
International Joint Conference on Artificial Intelligence
One important issue of automated theorem proving is the complexity of the inference rules used in theorem provers. If Krishnamurty's general symmetry rule is to be used, then one should provide some way of computing non trivial symmetries. We show that this problem is NP-complete. But this general rule can be simplified by restricting it to what we call 5symmetries, yielding the well-known symmetry rule. We show that computing 5-symmetries is in the same complexity class as the graph
dblp:conf/ijcai/TourD95
fatcat:3hnrdyerijf6paztys5k4fdw2i