Termination of disjoint unions of conditional term rewriting systems:
Abstract: "In this paper we extend several results concerning the termination of the disjoint union of term rewriting systems to conditional term rewriting systems. The first termination property we study is strong normalization (there are no infinite reduction sequences) and we show that suffi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1989
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,59 |
| Subjects: | |
| Summary: | Abstract: "In this paper we extend several results concerning the termination of the disjoint union of term rewriting systems to conditional term rewriting systems. The first termination property we study is strong normalization (there are no infinite reduction sequences) and we show that sufficient conditions for the strong normalization of the disjoint union of two strongly normalizing term rewriting systems given by Rusinowitch and Middeldorp extend naturally to conditional term rewriting systems. Weak normalization (every term reduces to a normal form) is the second property we are interested in. We show that for conditional term rewriting systems weak normalization is not preserved under disjoint unions This is rather surprising because the disjoint union of weakly normalizing unconditional term rewriting systems is weakly normalizing. Besides giving sufficient conditions for the weak normalization of disjoint unions of weakly normalizing conditional term rewriting systems, we will also give a much simpler proof of the recent approach to weak normalization due to Kurihara and Kaji |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949494 | ||
| 003 | DE-604 | ||
| 005 | 19990304 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23953855 | ||
| 035 | |a (DE-599)BVBBV008949494 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Middeldorp, Aart |d 1963- |e Verfasser |0 (DE-588)121450279 |4 aut | |
| 245 | 1 | 0 | |a Termination of disjoint unions of conditional term rewriting systems |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 24 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 89,59 | |
| 520 | 3 | |a Abstract: "In this paper we extend several results concerning the termination of the disjoint union of term rewriting systems to conditional term rewriting systems. The first termination property we study is strong normalization (there are no infinite reduction sequences) and we show that sufficient conditions for the strong normalization of the disjoint union of two strongly normalizing term rewriting systems given by Rusinowitch and Middeldorp extend naturally to conditional term rewriting systems. Weak normalization (every term reduces to a normal form) is the second property we are interested in. We show that for conditional term rewriting systems weak normalization is not preserved under disjoint unions | |
| 520 | 3 | |a This is rather surprising because the disjoint union of weakly normalizing unconditional term rewriting systems is weakly normalizing. Besides giving sufficient conditions for the weak normalization of disjoint unions of weakly normalizing conditional term rewriting systems, we will also give a much simpler proof of the recent approach to weak normalization due to Kurihara and Kaji | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,59 |w (DE-604)BV008928356 |9 89,59 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905151 | ||
Record in the Search Index
| _version_ | 1804123282602983424 |
|---|---|
| any_adam_object | |
| author | Middeldorp, Aart 1963- |
| author_GND | (DE-588)121450279 |
| author_facet | Middeldorp, Aart 1963- |
| author_role | aut |
| author_sort | Middeldorp, Aart 1963- |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV008949494 |
| ctrlnum | (OCoLC)23953855 (DE-599)BVBBV008949494 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02128nam a2200301 cb4500</leader><controlfield tag="001">BV008949494</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990304 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23953855</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949494</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Middeldorp, Aart</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121450279</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Termination of disjoint unions of conditional term rewriting systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">89,59</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we extend several results concerning the termination of the disjoint union of term rewriting systems to conditional term rewriting systems. The first termination property we study is strong normalization (there are no infinite reduction sequences) and we show that sufficient conditions for the strong normalization of the disjoint union of two strongly normalizing term rewriting systems given by Rusinowitch and Middeldorp extend naturally to conditional term rewriting systems. Weak normalization (every term reduces to a normal form) is the second property we are interested in. We show that for conditional term rewriting systems weak normalization is not preserved under disjoint unions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This is rather surprising because the disjoint union of weakly normalizing unconditional term rewriting systems is weakly normalizing. Besides giving sufficient conditions for the weak normalization of disjoint unions of weakly normalizing conditional term rewriting systems, we will also give a much simpler proof of the recent approach to weak normalization due to Kurihara and Kaji</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">89,59</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,59</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905151</subfield></datafield></record></collection> |
| id | DE-604.BV008949494 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905151 |
| oclc_num | 23953855 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 24 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Middeldorp, Aart 1963- Verfasser (DE-588)121450279 aut Termination of disjoint unions of conditional term rewriting systems Amsterdam 1989 24 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,59 Abstract: "In this paper we extend several results concerning the termination of the disjoint union of term rewriting systems to conditional term rewriting systems. The first termination property we study is strong normalization (there are no infinite reduction sequences) and we show that sufficient conditions for the strong normalization of the disjoint union of two strongly normalizing term rewriting systems given by Rusinowitch and Middeldorp extend naturally to conditional term rewriting systems. Weak normalization (every term reduces to a normal form) is the second property we are interested in. We show that for conditional term rewriting systems weak normalization is not preserved under disjoint unions This is rather surprising because the disjoint union of weakly normalizing unconditional term rewriting systems is weakly normalizing. Besides giving sufficient conditions for the weak normalization of disjoint unions of weakly normalizing conditional term rewriting systems, we will also give a much simpler proof of the recent approach to weak normalization due to Kurihara and Kaji Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,59 (DE-604)BV008928356 89,59 |
| spellingShingle | Middeldorp, Aart 1963- Termination of disjoint unions of conditional term rewriting systems Rewriting systems (Computer science) |
| title | Termination of disjoint unions of conditional term rewriting systems |
| title_auth | Termination of disjoint unions of conditional term rewriting systems |
| title_exact_search | Termination of disjoint unions of conditional term rewriting systems |
| title_full | Termination of disjoint unions of conditional term rewriting systems |
| title_fullStr | Termination of disjoint unions of conditional term rewriting systems |
| title_full_unstemmed | Termination of disjoint unions of conditional term rewriting systems |
| title_short | Termination of disjoint unions of conditional term rewriting systems |
| title_sort | termination of disjoint unions of conditional term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart terminationofdisjointunionsofconditionaltermrewritingsystems |