Some Techniques of Isomorph-Free Search

Authors:
Thierry Boy de la Tour
Affiliations:
-
Venue:
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Year:
2000

Citing 1
Cited 1

On the Complexity of Finite Sorted Algebras

Selected Papers from Automated Deduction in Classical and Non-Classical Logics

MACE4 and SEM: a comparison of finite model generators

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.