Abstract
The problem of isomorph-free search is analysed in a group theoretic framework, some algorithms are given for building searches in a modular way, and the context in which they can be applied is characterised as generally as possible. These results are applied to the problem of building finite models of monadic first-order sorted logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Leslie Ann Henderson. Efficient algorithms for listing unlabelled graphs. Technical Report CSR-7-90, University of Edinburgh, Department of Computer Science, 1990.
C. Hoffmann. Group-theoretic algorithms and graph isomorphism. Lecture Notes in Computer Science 136. Springer Verlag, 1981.
Nicolas Peltier. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation, 4(8):511–543, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boy, T. (2001). Some Techniques of Isomorph-Free Search. In: Campbell, J.A., Roanes-Lozano, E. (eds) Artificial Intelligence and Symbolic Computation. AISC 2000. Lecture Notes in Computer Science(), vol 1930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44990-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-44990-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42071-2
Online ISBN: 978-3-540-44990-4
eBook Packages: Springer Book Archive