Internet Archive Scholar

Validating Reasoning Heuristics Using Next-Generation Theorem-Provers
english

2007 Proceedings of the 5th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems   unpublished

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (926.0 kB)
https://web.archive.org/web/20170815182045/http://uir.unisa.ac.za/bitstream/handle/10500/2793/dissertation_steyn_p.pdf?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The specification of enterprise information systems using formal specification languages enables the formal verification of these systems. Reasoning about the properties of a formal specification is a tedious task that can be facilitated much through the use of an automated reasoner. However, set theory is a corner stone of many formal specification languages and poses demanding challenges to automated reasoners. To this end a number of heuristics has been developed to aid the Otter theorem
more » ... er in finding short proofs for set-theoretic problems. This dissertation investigates the applicability of these heuristics to next generation theorem provers.
doi:10.5220/0002425900430052 fatcat:yuw5ooluyjf2dfapwfs6fsqcoy
Citation

"Validating Reasoning Heuristics Using Next-Generation Theorem-Provers." Proceedings of the 5th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (2007)