An Isomorph-Free SEM-Like Enumeration of Models

Authors:
Thierry Boy de la Tour;Prakash Countcham
Affiliations:
LEIBNIZ laboratory, IMAG - CNRS, INPG, 46 avenue Félix Viallet F-38031 Grenoble Cedex, France;LEIBNIZ laboratory, IMAG - CNRS, INPG, 46 avenue Félix Viallet F-38031 Grenoble Cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 5
Cited 1

Term rewriting and all that

Term rewriting and all that
Isomorph-free exhaustive generation

Journal of Algorithms
A Note on Symmetry Heuristics in SEM

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The eXtended Least Number Heuristic

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

A powerful technique to eliminate isomorphism in finite model search

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the integration of the enumeration of finite models of a formula, including unit propagation and pruning mechanisms, as provided by the system SEM, into McKay's general method of isomorph-free exhaustive enumeration. The two techniques turn out to be nicely compatible, though this requires some adaptations, and to prove some non-trivial properties.