Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Experimental results on subgoal reordering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Nie, X. ; Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA ; Plaisted, David A.

The effect on the performance of a goal-oriented theorem power is studied on subgoal re-ordering using some simple synthetic heuristics. It is shown that subgoal reordering using these simple heuristics has a considerable impact on the performance of the prover on a large set of test problems. Some heuristics even provide equally good, and often better, performance as to the hand ordering of the input clauses. The merit of the approach seems to be that the syntactic aspect of theorem proving is considered. This approach is simple in form and cheap in its evaluation, and often provides good heuristics

Published in:

Computers, IEEE Transactions on  (Volume:39 ,  Issue: 6 )