Abstract: | Symmetry arguments have been put forward in many areas of automated deduction. The arguments range over domains such as propositional satisfiability checking and verification of concurrent hardware components. The formal descriptions of these arguments lack generality so that it is difficult to compare them and usually quite difficult to understand wh they work. I propose to formulate symmetry arguments in ways minimally dependent on the underlying logics, to verify arguments formally over a broad spectrum of logical calculi and to implement symmetry arguments as methods within established proof planning systems.
|