Constraints for Argument Filterings
スポンサーリンク
概要
- 論文の詳細を見る
Proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007.The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and KBO, argument filterings play a key role. In this paper we propose an encoding of argument filterings in propositional logic. By incorporating propositional encodings of simplification orders, the search for suitable argument filterings is turned into a satisfiability problem. Preliminary experimental results show that our logic-based approach is significantly faster than existing implementations.
- Springerの論文
- 2007-00-00
Springer | 論文
- Comparisons of germination traits of alpine plants between fellfield and snowbed habitats
- Photoreceptor Images of Normal Eyes and of Eyes with Macular Dystrophy Obtained In Vivo with an Adaptive Optics Fundus Camera
- Effect of Electrical Stimulation on IGF-1 Transcription by L-Type Calcium Channels in Cultured Retinal Muller Cells
- In Vivo Measurements of Cone Photoreceptor Spacing in Myopic Eyes from Images Obtained by an Adaptive Optics Fundus Camera
- Optical Quality of the Eye Degraded by Time-Varying Wavefront Aberrations with Tear Film Dynamics