SLOTHROP : Knuth-bendix completion with a modern termination checker

Conference proceeding

Peer reviewed

Ian Wehrman, Aaron Stump and Edwin Westbrook

Lecture notes in computer science, Vol.4098, pp.287-296

Term rewriting and applications (17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006)

2006

DOI: 10.1007/11805618_22

View Online

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Information retrieval. Graph

Programming languages

Software

Theoretical computing

Title: Subtitle: SLOTHROP : Knuth-bendix completion with a modern termination checker
Creators: Ian Wehrman - Washington University in St. Louis
Aaron Stump - Washington University in St. Louis
Edwin Westbrook - Washington University in St. Louis
Resource Type: Conference proceeding
Publication Details: Lecture notes in computer science, Vol.4098, pp.287-296
Conference: Term rewriting and applications (17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006)
Publisher: Springer
DOI: 10.1007/11805618_22
ISSN: 0302-9743
eISSN: 1611-3349
Language: English
Date published: 2006
Academic Unit: Computer Science
Record Identifier: 9984259489702771

10 Record Views