Institutional Repository
| constructing finite algebras with falcon | |
| Zhang Jian | |
| 1996 | |
| Source | Journal of Automated Reasoning
 |
| Volume | 17Issue:1Pages:1-22 |
| English Abstract | The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system. |
| Indexed Type | sci |
| Keyword | Model Generation Finite Algebras Constraint Satisfaction Least Number Heuristic |
| Department | 计算机科学国家重点实验室 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/3190 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Zhang Jian. constructing finite algebras with falcon[J]. Journal of Automated Reasoning,1996,17(1):1-22. |
| APA | Zhang Jian.(1996).constructing finite algebras with falcon.Journal of Automated Reasoning,17(1),1-22. |
| MLA | Zhang Jian."constructing finite algebras with falcon".Journal of Automated Reasoning 17.1(1996):1-22. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment