Counterexamples to completeness results for basic narrowing:
Abstract: "In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic res...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,54 |
| Subjects: | |
| Summary: | Abstract: "In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Holldobler which states the completeness of basic conditional narrowing for complete (i.e. confluent and terminating) conditional term rewriting systems without extra variables in the conditions of the rewrite rules In the last part of the paper we extend the completeness result of Giovannetti and Moiso for level-confluent and terminating conditional systems with extra variables in the conditions to systems that may also have extra variables in the right-hand sides of the rules. |
| Physical Description: | 44 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993174 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27471547 | ||
| 035 | |a (DE-599)BVBBV008993174 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Middeldorp, Aart |d 1963- |e Verfasser |0 (DE-588)121450279 |4 aut | |
| 245 | 1 | 0 | |a Counterexamples to completeness results for basic narrowing |c A. Middeldorp, E. Hamoen |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 44 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 91,54 | |
| 520 | 3 | |a Abstract: "In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Holldobler which states the completeness of basic conditional narrowing for complete (i.e. confluent and terminating) conditional term rewriting systems without extra variables in the conditions of the rewrite rules | |
| 520 | 3 | |a In the last part of the paper we extend the completeness result of Giovannetti and Moiso for level-confluent and terminating conditional systems with extra variables in the conditions to systems that may also have extra variables in the right-hand sides of the rules. | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Hamoen, Erik |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,54 |w (DE-604)BV008928356 |9 91,54 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941997 | ||
Record in the Search Index
| _version_ | 1804123335689240576 |
|---|---|
| any_adam_object | |
| author | Middeldorp, Aart 1963- Hamoen, Erik |
| author_GND | (DE-588)121450279 |
| author_facet | Middeldorp, Aart 1963- Hamoen, Erik |
| author_role | aut aut |
| author_sort | Middeldorp, Aart 1963- |
| author_variant | a m am e h eh |
| building | Verbundindex |
| bvnumber | BV008993174 |
| ctrlnum | (OCoLC)27471547 (DE-599)BVBBV008993174 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01936nam a2200313 cb4500</leader><controlfield tag="001">BV008993174</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27471547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993174</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></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">Counterexamples to completeness results for basic narrowing</subfield><subfield code="c">A. Middeldorp, E. Hamoen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">44 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">91,54</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Holldobler which states the completeness of basic conditional narrowing for complete (i.e. confluent and terminating) conditional term rewriting systems without extra variables in the conditions of the rewrite rules</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In the last part of the paper we extend the completeness result of Giovannetti and Moiso for level-confluent and terminating conditional systems with extra variables in the conditions to systems that may also have extra variables in the right-hand sides of the rules.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hamoen, Erik</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">91,54</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,54</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941997</subfield></datafield></record></collection> |
| id | DE-604.BV008993174 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941997 |
| oclc_num | 27471547 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 44 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 Counterexamples to completeness results for basic narrowing A. Middeldorp, E. Hamoen Amsterdam 1991 44 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,54 Abstract: "In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Holldobler which states the completeness of basic conditional narrowing for complete (i.e. confluent and terminating) conditional term rewriting systems without extra variables in the conditions of the rewrite rules In the last part of the paper we extend the completeness result of Giovannetti and Moiso for level-confluent and terminating conditional systems with extra variables in the conditions to systems that may also have extra variables in the right-hand sides of the rules. Rewriting systems (Computer science) Hamoen, Erik Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,54 (DE-604)BV008928356 91,54 |
| spellingShingle | Middeldorp, Aart 1963- Hamoen, Erik Counterexamples to completeness results for basic narrowing Rewriting systems (Computer science) |
| title | Counterexamples to completeness results for basic narrowing |
| title_auth | Counterexamples to completeness results for basic narrowing |
| title_exact_search | Counterexamples to completeness results for basic narrowing |
| title_full | Counterexamples to completeness results for basic narrowing A. Middeldorp, E. Hamoen |
| title_fullStr | Counterexamples to completeness results for basic narrowing A. Middeldorp, E. Hamoen |
| title_full_unstemmed | Counterexamples to completeness results for basic narrowing A. Middeldorp, E. Hamoen |
| title_short | Counterexamples to completeness results for basic narrowing |
| title_sort | counterexamples to completeness results for basic narrowing |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart counterexamplestocompletenessresultsforbasicnarrowing AT hamoenerik counterexamplestocompletenessresultsforbasicnarrowing |