Predicate-Oriented Isomorphism Elimination in Model Finding
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1525-1515.
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.
Xiangxue Jia, and Jian Zhang. 2005. Predicate-Oriented Isomorphism Elimination in Model Finding. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1525–1515. https://ijcai.org/proceedings/2005/296
Jia, X., & Zhang, J. (2005). Predicate-Oriented Isomorphism Elimination in Model Finding. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 1525–1515). IJCAI. https://ijcai.org/proceedings/2005/296
@inproceedings{ijcai2005p296,
title = {Predicate-Oriented Isomorphism Elimination in Model Finding},
author = {Jia, Xiangxue and Zhang, Jian},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1525--1515},
year = {2005},
url = {https://ijcai.org/proceedings/2005/296},
}
TY - CPAPER TI - Predicate-Oriented Isomorphism Elimination in Model Finding AU - Jia, Xiangxue AU - Zhang, Jian T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1525 EP - 1515 UR - https://ijcai.org/proceedings/2005/296 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
