ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
11
views
11
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,743
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
8th International Conference on Automated Deduction
Commutation, transformation, and termination
other
Author(s):
Leo Bachmair
,
Nachum Dershowitz
Publication date
(Online):
May 31 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
International Journal of Automation & Digital Transformation
Most cited references
11
Record
: found
Abstract
: not found
Article
: not found
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
Gérard Huet
(1980)
0
comments
Cited
74
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Tree-Manipulating Systems and Church-Rosser Theorems
Barry Rosen
(1973)
0
comments
Cited
37
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
On proving inductive properties of abstract data types
David Musser
(1980)
0
comments
Cited
16
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1986
Publication date (Online):
May 31 2005
Pages
: 5-20
DOI:
10.1007/3-540-16780-3_76
SO-VID:
a92505f9-bc3f-4d53-b928-fd4d0731f929
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 21
Full-commutation and fair-termination in equational (and combined) term-rewriting systems
pp. 5
Commutation, transformation, and termination
pp. 79
A simple non-termination test for the Knuth-Bendix method
pp. 89
A new formula for the execution of categorical combinators
pp. 99
Proof by induction using test sets
pp. 128
Sufficient completeness, term rewriting systems and ”anti-unification”
pp. 281
Formulation of induction formulas in verification of prolog programs
pp. 431
Unification in combinations of collapse-free theories with disjoint sets of function symbols
pp. 450
Combination of unification algorithms
pp. 506
Unification in boolean rings
pp. 608
Causes for events: Their computation and applications
pp. 691
RRL: A rewrite rule laboratory
Similar content
2,743
Experimental Demonstration of the Bosonic Commutation Relation via Superpositions of Quantum Operations on Thermal Light Fields
Authors:
A. Zavatta
,
V Parigi
,
M. S. Kim
…
Matrix Configurations for Spherical 4-branes and Non-commutative Structures on S^4
Authors:
Ryuichi Nakayama
,
Yusuke Shimono
COMMUTE: communication-efficient transfer learning for multi-site risk prediction
Authors:
T. GU
,
P.H. Lee
,
R Duan
See all similar
Cited by
10
Termination of rewriting
Authors:
Nachum Dershowitz
Termination of Linear Programs
Authors:
Ashish Tiwari
Dependency Pairs Revisited
Authors:
Nao Hirokawa
,
Aart Middeldorp
See all cited by