Improving the Efficiency of Reasoning Through Structure-Based Reformulation (2000)
Cached
Download Links
- [www.cs.toronto.edu]
- [www.cs.toronto.edu]
- [www-formal.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Proceedings of the International Symposium on Abstractions, Reformulation, and Approximation (SARA), Lecture Notes in Artificial Intelligence |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Amir00improvingthe,
author = {Eyal Amir and Sheila Mcilraith},
title = {Improving the Efficiency of Reasoning Through Structure-Based Reformulation},
booktitle = {in Proceedings of the International Symposium on Abstractions, Reformulation, and Approximation (SARA), Lecture Notes in Artificial Intelligence},
year = {2000},
pages = {247--259},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning strategies. To this end, we provide algorithms for reasoning with partitions of axioms in first-order and propositional logic. We analyze the computational benefit of our algorithms and detect those parameters of a partitioning that influence the efficiency of computation. These parameters are the number of symbols shared by a pair of partitions, the size of each partition, and the topology of the partitioning. Finally, we provide a greedy algorithm that automatically reformulates a given theory into partitions, exploiting the parameters that influence the efficiency of computation. 1
