Abstract
We present a method to optimize formulations of mathematical problems by exploiting the variability of first-order logic. The optimizing transformation is described as logic morphisms, whose operationalizations are tactics. The different behaviour of a resolution theorem prover for the source and target formulations is demonstrated by several examples. Such tactics give a user the possibility to formally manipulate problem formulations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
