The STO-problem is NP-hardp:
Abstract: " A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur- check. We prove here that the problem of deciding whether E is STO is NP- hard.&qu...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1994
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,64 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: " A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur- check. We prove here that the problem of deciding whether E is STO is NP- hard." |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010162072 | ||
| 003 | DE-604 | ||
| 005 | 19960325 | ||
| 007 | t | ||
| 008 | 950428s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)32882289 | ||
| 035 | |a (DE-599)BVBBV010162072 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 | ||
| 100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
| 245 | 1 | 0 | |a The STO-problem is NP-hardp |c K. R. Apt ; P. van Emde Boas ; A. Welling |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 7 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 94,64 | |
| 520 | 3 | |a Abstract: " A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur- check. We prove here that the problem of deciding whether E is STO is NP- hard." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Emde Boas, Peter van |e Verfasser |4 aut | |
| 700 | 1 | |a Welling, Angelo |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,64 |w (DE-604)BV008928356 |9 94,64 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006748540 | ||
Datensatz im Suchindex
| _version_ | 1804124556774866944 |
|---|---|
| any_adam_object | |
| author | Apt, Krzysztof R. 1949- Emde Boas, Peter van Welling, Angelo |
| author_GND | (DE-588)110139763 |
| author_facet | Apt, Krzysztof R. 1949- Emde Boas, Peter van Welling, Angelo |
| author_role | aut aut aut |
| author_sort | Apt, Krzysztof R. 1949- |
| author_variant | k r a kr kra b p v e bpv bpve a w aw |
| building | Verbundindex |
| bvnumber | BV010162072 |
| ctrlnum | (OCoLC)32882289 (DE-599)BVBBV010162072 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01382nam a2200313 cb4500</leader><controlfield tag="001">BV010162072</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960325 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950428s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32882289</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010162072</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-19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The STO-problem is NP-hardp</subfield><subfield code="c">K. R. Apt ; P. van Emde Boas ; A. Welling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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">94,64</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: " A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur- check. We prove here that the problem of deciding whether E is STO is NP- hard."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Emde Boas, Peter van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Welling, Angelo</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">94,64</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,64</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006748540</subfield></datafield></record></collection> |
| id | DE-604.BV010162072 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006748540 |
| oclc_num | 32882289 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM |
| owner_facet | DE-19 DE-BY-UBM |
| physical | 7 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut The STO-problem is NP-hardp K. R. Apt ; P. van Emde Boas ; A. Welling Amsterdam 1994 7 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,64 Abstract: " A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur- check. We prove here that the problem of deciding whether E is STO is NP- hard." Logic programming Emde Boas, Peter van Verfasser aut Welling, Angelo Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,64 (DE-604)BV008928356 94,64 |
| spellingShingle | Apt, Krzysztof R. 1949- Emde Boas, Peter van Welling, Angelo The STO-problem is NP-hardp Logic programming |
| title | The STO-problem is NP-hardp |
| title_auth | The STO-problem is NP-hardp |
| title_exact_search | The STO-problem is NP-hardp |
| title_full | The STO-problem is NP-hardp K. R. Apt ; P. van Emde Boas ; A. Welling |
| title_fullStr | The STO-problem is NP-hardp K. R. Apt ; P. van Emde Boas ; A. Welling |
| title_full_unstemmed | The STO-problem is NP-hardp K. R. Apt ; P. van Emde Boas ; A. Welling |
| title_short | The STO-problem is NP-hardp |
| title_sort | the sto problem is np hardp |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT aptkrzysztofr thestoproblemisnphardp AT emdeboaspetervan thestoproblemisnphardp AT wellingangelo thestoproblemisnphardp |