Comparing Approaches to the Exploration of the Domain of Residue Classes
β Scribed by Andreas Meier; Martin Pollet; Volker Sorge
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 385 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proof techniques, which are implemented as strategies in a multi-strategy proof planner. The search space of the proof planner can be drastically reduced by employing computations of two computer algebra systems during the planning process. To test the effectiveness of our approach we carried out a large number of experiments and also compared it with some alternative approaches. In particular, we experimented with substituting computer algebra by model generation and by proving theorems with a first-order equational theorem prover instead of a proof planner.
π SIMILAR VOLUMES
It is well known that if a,, . , a, are residues module n and m an then some sum ai, + . . .+q,, iI<...<&, is 0 (mod n). In recent related work, Sydney Bulman-Fleming and Edward T.H. Wang have studied what they call n-divisible subsequences of a finite sequence u, and made a number of conjectures. W
## Abstract In this paper, we associate an applicability domain (AD) of QSAR/QSPR models with the area in the input (descriptor) space in which the density of training data points exceeds a certain threshold. It could be proved that the predictive performance of the models (built on the training se