Predicate-Oriented Isomorphism Elimination in Model Finding
Abstract
Finding models of logical formulas is a challenging problem. For first-order formulas, a finite model can be found by exhaustive search. For many structured problem instances, there is much isomorphism in the search space. This paper proposes general-purpose techniques for eliminating isomorphic subspaces, which can be helpful when the formulas have many predicates. The techniques are based on inherent symmetries in first-order clauses.
Cite
Text
Jia and Zhang. "Predicate-Oriented Isomorphism Elimination in Model Finding." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Jia and Zhang. "Predicate-Oriented Isomorphism Elimination in Model Finding." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/jia2005ijcai-predicate/)BibTeX
@inproceedings{jia2005ijcai-predicate,
title = {{Predicate-Oriented Isomorphism Elimination in Model Finding}},
author = {Jia, Xiangxue and Zhang, Jian},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {1525-1516},
url = {https://mlanthology.org/ijcai/2005/jia2005ijcai-predicate/}
}