Author:
Audemard Gilles,Benhamou Belaid
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. G. Audemard and L. Henocque. The extended least number heuristic. Proceedings of the first International Joint Conference in Automated Reasoning (IJCAR), Springer Verlag, 2001.
2. B. Benhamou and L. Henocque. A hybrid method for finite model search in equational theories. Fundamenta Informaticae, 39(1–2):21–38, 1999.
3. B. Benhamou and L. Sais. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12(1):89–102, 1994.
4. J. Crawford. A theorical analisys of reasoning by symmetry in first-order logic. In Proceedings of Workshop on Tractable Reasonning, AAI92, pages 17–22, 1992.
5. J. Crawford, M. L. Ginsberg, E. Luck, and A. Roy. Symmetry-breaking predicates for search problems. In proceedings of KR’96, pages 148–159. 1996.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On local domain symmetry for model expansion;Theory and Practice of Logic Programming;2016-09
2. Symmetries in Modal Logics;Electronic Proceedings in Theoretical Computer Science;2013-03-28
3. MACE4 and SEM: A Comparison of Finite Model Generators;Automated Reasoning and Mathematics;2013
4. Predicting and Detecting Symmetries in FOL Finite Model Search;Journal of Automated Reasoning;2006-12-01
5. Automated Model Building: From Finite to Infinite Models;Lecture Notes in Computer Science