On the inherent necessity of heuristic proofs | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

On the inherent necessity of heuristic proofs


Abstract:

It follows from the nonreducibility of the theorization problem that an arbitrary proof cannot be valid on an absolute scale. Thus, in order for an arbitrary proof to be ...Show More

Abstract:

It follows from the nonreducibility of the theorization problem that an arbitrary proof cannot be valid on an absolute scale. Thus, in order for an arbitrary proof to be generative, it must be self-referential; but then, it must also be heuristic if not incomplete as a consequence. By relaxing the validity requirement, heuristic (i.e., relative) proof techniques are enabled. We show that heuristics are search randomizations in space-time. It is shown how one can develop heuristics, which are randomizations of knowledge. Even more intriguing, it is shown that heuristic proof is to formal proof what fuzzy logic is to formal logic. Simply put, the paper argues for the need to relax the notion of formal proof if AI is to advance.
Date of Conference: 12-12 October 2005
Date Added to IEEE Xplore: 10 January 2006
Print ISBN:0-7803-9298-1
Print ISSN: 1062-922X
Conference Location: Waikoloa, HI, USA

References

References is not available for this document.