Abstract
The shift to semantic symmetries is motivated by the fact that, in contrast with syntactic symmetries, these are preserved under standard inference rules such as resolution. It is then possible to attach groups of semantic symmetries to sets of ground clauses. These groups can provide information useful to inference, as illustrated by three “symmetric” rules. These rules are to be applied in well-defined, disjoint cases, they simplify both the set of clauses and the attached group, they use standard and efficient techniques from computational group theory, and therefore they can be easily mechanised. A prototype GAP implementation is described, and an example developed. Finally, some complexity results concerning the computation of semantic symmetries are given.
supported by the Centre National de la Recherche Scientifique (CNRS).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. D. Atkinson. An algorithm for finding the blocks of a permutation group. Mathematics of computation, 29(131):911–913, july 1975.
B. Benhamou and L. Sais. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12:89–102, 1994.
T. Boy de la Tour and S. Demri. On the complexity of extending ground resolution with symmetry rules. In C. S. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence IJCAI'95, pages 289–295, 1995.
G. Butler. Fundamental algorithms for permutation groups. Lecture Notes in Computer Science 559. Springer Verlag, 1991.
E. Emerson and A. Sistla. Symmetry and model checking. In C. Courcoubetis, editor, Proceeding of CAV'93, LNCS 697, pages 463–478. Springer Verlag, 1993.
M. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, California, 1979.
C. Hoffmann. Group-theoretic algorithms and graph isomorphism. Lecture Notes in Computer Science 136. Springer Verlag, 1981.
B. Krishnamurty. Short proofs for tricky formulas. Acta Informatica, 22:253–275, 1985.
B. D. McKay, nauty user's guide (version 1.5). Technical Report TR-CS-90-02, Australian National University, Computer Science Department, 1990.
M. Schönert, H. U. Besche, F. Celler, V. Felsh, A. Hulpke, J. Mnich, G. Pfeiffer, U. Polis, H. Theißen, and A. Niemeyer. GAP: Groups, Algorithms and Programming (version 3 release 4). Lehrstuhl D für Mathematik, RWTH Aachen, july 1994. Can be obtained by anonymous ftp from ftp.math.rwth-aachen.de in pub/gap.
W. R. Scott. Group Theory. Dover Publications, New York, 1987. first published by Prentice-Hall, 1964.
C. C. Sims. Computational methods in the study of permutation groups. In J. Leech, editor, Computational Problems in Abstract Algebra, Proc. Conf. Oxford, 1967, pages 169–183. Pergamon Press, Oxford, 1970.
L. H. Soicher. GRAPE: a system for computing with graphs and groups. In L. Finkelstein and B. Kantor, editors, Proceedings of the 1991 DIMACS workshop on Groups and Computation, pages 287–291. AMS, 1993. Volume 11 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Tour, T.B. (1996). Ground resolution with group computations on semantic symmetries. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_108
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive