Some techniques of isomorph-free search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1930, Issue , 2001, Pages 240-252

  De La Tour, Thierry Boy ^a  

^a Laboratoire Leibniz   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY;

FINITE MODEL; FIRST ORDER; ISOMORPH FREE SEARCH;

GROUP THEORY;

EID: 84974739753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44990-6_20     Document Type: Conference Paper

References (4)

1. Thierry Boy de la Tour. On the complexity of finite sorted algebras. In Ricardo Caferra and Gernot Salzer, editors, Automated Deduction in Classical and Non-Classical Logics, Lecture Notes in Artificial Intelligence, LNCS 1761, pages 95-108. Springer Verlag, 1999.
2. Leslie Ann Henderson. Efficient algorithms for listing unlabelled graphs. Technical Report CSR-7-90, University of Edinburgh, Department of Computer Science, 1990.
3. C. Hoffmann. Group-theoretic algorithms and graph isomorphism. Lecture Notes in Computer Science 136. Springer Verlag, 1981.
4. Nicolas Peltier. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation, 4(8): 511-543, 1998.