RRL: theorem proving environment based on rewriting techniques
Pages 67 - 68
Abstract
No abstract available.
Recommendations
RRL: A Rewrite Rule Laboratory
Proceedings of the 8th International Conference on Automated DeductionRRL: A Rewrite Rule Laboratory
Proceedings of the 9th International Conference on Automated DeductionComplementing RRL for dialogue summarisation
IBERAMIA'10: Proceedings of the 12th Ibero-American conference on Advances in artificial intelligenceThis paper describes the use of NECA'S RRL - Rich Representation Language - in the aid of automatic dialogue summarisation. We start by defining a set of summary acts, and then present a mapping between these acts, taken from human generated summaries, ...
Comments
Information & Contributors
Information
Published In

Copyright © 1985 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1985
Published in SIGSOFT Volume 10, Issue 4
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 113Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)4
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in