On the complexity of monotonic inheritance with roles:
Abstract: "We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouseof or brotherof. We call such networks ISAR networks. Given a network with n vert...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Stanford, Calif.
1990
|
Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1324 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouseof or brotherof. We call such networks ISAR networks. Given a network with n vertices and m edges we consider two problems: (P b1 s) determining whether the network implies an isa relation between two particular nodes, and (P b2 s) determining all isa relations implied by the network. As is well known, without ROLE edges the time complexity of P b1 s is O(m), and the time complexity of P b2 s is O(n p3 s). Unfortunately, the results do not extend naturally to ISAR networks, except in a very restricted case For general ISAR network [sic] we first give an [sic] polynomial algorithm by an easy reduction to proposional Horn theory. As the degree of the polynomial is quite high (O(mn p4 s) for P b1 s, O(mn p6 s) for P b2 s), we then develop a more direct algorithm. For both P b1 s and P b2 s its complexity is O(n p3 s + m p2 s). Actually, a finer analysis of the algorithm reveals a complexity of O(nr(log r) + n p2 sr + n p3 s), where r is the number of different ROLE labels. One corolary [sic] is that if we fix the number of ROLE labels, the complexity of our algorithm drops back to O(n p3 s). |
Beschreibung: | 6 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008973907 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)25201908 | ||
035 | |a (DE-599)BVBBV008973907 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
050 | 0 | |a QA76.9.D3 | |
082 | 0 | |a 005.7/3 |2 20 | |
100 | 1 | |a Guerreira, Ramiro A. de |e Verfasser |4 aut | |
245 | 1 | 0 | |a On the complexity of monotonic inheritance with roles |c by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham |
264 | 1 | |a Stanford, Calif. |c 1990 | |
300 | |a 6 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1324 | |
520 | 3 | |a Abstract: "We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouseof or brotherof. We call such networks ISAR networks. Given a network with n vertices and m edges we consider two problems: (P b1 s) determining whether the network implies an isa relation between two particular nodes, and (P b2 s) determining all isa relations implied by the network. As is well known, without ROLE edges the time complexity of P b1 s is O(m), and the time complexity of P b2 s is O(n p3 s). Unfortunately, the results do not extend naturally to ISAR networks, except in a very restricted case | |
520 | 3 | |a For general ISAR network [sic] we first give an [sic] polynomial algorithm by an easy reduction to proposional Horn theory. As the degree of the polynomial is quite high (O(mn p4 s) for P b1 s, O(mn p6 s) for P b2 s), we then develop a more direct algorithm. For both P b1 s and P b2 s its complexity is O(n p3 s + m p2 s). Actually, a finer analysis of the algorithm reveals a complexity of O(nr(log r) + n p2 sr + n p3 s), where r is the number of different ROLE labels. One corolary [sic] is that if we fix the number of ROLE labels, the complexity of our algorithm drops back to O(n p3 s). | |
650 | 4 | |a Künstliche Intelligenz | |
650 | 4 | |a Artificial intelligence | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Database management | |
700 | 1 | |a Hamerly, Andrea S. |e Verfasser |4 aut | |
700 | 1 | |a Shoham, Yoav |e Verfasser |4 aut | |
810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1324 |w (DE-604)BV008928280 |9 1324 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005925558 |
Datensatz im Suchindex
_version_ | 1804123311878176768 |
---|---|
any_adam_object | |
author | Guerreira, Ramiro A. de Hamerly, Andrea S. Shoham, Yoav |
author_facet | Guerreira, Ramiro A. de Hamerly, Andrea S. Shoham, Yoav |
author_role | aut aut aut |
author_sort | Guerreira, Ramiro A. de |
author_variant | r a d g rad radg a s h as ash y s ys |
building | Verbundindex |
bvnumber | BV008973907 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.D3 |
callnumber-search | QA76.9.D3 |
callnumber-sort | QA 276.9 D3 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)25201908 (DE-599)BVBBV008973907 |
dewey-full | 005.7/3 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.7/3 |
dewey-search | 005.7/3 |
dewey-sort | 15.7 13 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02568nam a2200385 cb4500</leader><controlfield tag="001">BV008973907</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25201908</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973907</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="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7/3</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Guerreira, Ramiro A. de</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of monotonic inheritance with roles</subfield><subfield code="c">by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6 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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1324</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouseof or brotherof. We call such networks ISAR networks. Given a network with n vertices and m edges we consider two problems: (P b1 s) determining whether the network implies an isa relation between two particular nodes, and (P b2 s) determining all isa relations implied by the network. As is well known, without ROLE edges the time complexity of P b1 s is O(m), and the time complexity of P b2 s is O(n p3 s). Unfortunately, the results do not extend naturally to ISAR networks, except in a very restricted case</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For general ISAR network [sic] we first give an [sic] polynomial algorithm by an easy reduction to proposional Horn theory. As the degree of the polynomial is quite high (O(mn p4 s) for P b1 s, O(mn p6 s) for P b2 s), we then develop a more direct algorithm. For both P b1 s and P b2 s its complexity is O(n p3 s + m p2 s). Actually, a finer analysis of the algorithm reveals a complexity of O(nr(log r) + n p2 sr + n p3 s), where r is the number of different ROLE labels. One corolary [sic] is that if we fix the number of ROLE labels, the complexity of our algorithm drops back to O(n p3 s).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hamerly, Andrea S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shoham, Yoav</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1324</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1324</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925558</subfield></datafield></record></collection> |
id | DE-604.BV008973907 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925558 |
oclc_num | 25201908 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 6 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | Stanford University / Computer Science Department: Report STAN CS |
spelling | Guerreira, Ramiro A. de Verfasser aut On the complexity of monotonic inheritance with roles by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham Stanford, Calif. 1990 6 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1324 Abstract: "We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouseof or brotherof. We call such networks ISAR networks. Given a network with n vertices and m edges we consider two problems: (P b1 s) determining whether the network implies an isa relation between two particular nodes, and (P b2 s) determining all isa relations implied by the network. As is well known, without ROLE edges the time complexity of P b1 s is O(m), and the time complexity of P b2 s is O(n p3 s). Unfortunately, the results do not extend naturally to ISAR networks, except in a very restricted case For general ISAR network [sic] we first give an [sic] polynomial algorithm by an easy reduction to proposional Horn theory. As the degree of the polynomial is quite high (O(mn p4 s) for P b1 s, O(mn p6 s) for P b2 s), we then develop a more direct algorithm. For both P b1 s and P b2 s its complexity is O(n p3 s + m p2 s). Actually, a finer analysis of the algorithm reveals a complexity of O(nr(log r) + n p2 sr + n p3 s), where r is the number of different ROLE labels. One corolary [sic] is that if we fix the number of ROLE labels, the complexity of our algorithm drops back to O(n p3 s). Künstliche Intelligenz Artificial intelligence Computational complexity Database management Hamerly, Andrea S. Verfasser aut Shoham, Yoav Verfasser aut Computer Science Department: Report STAN CS Stanford University 1324 (DE-604)BV008928280 1324 |
spellingShingle | Guerreira, Ramiro A. de Hamerly, Andrea S. Shoham, Yoav On the complexity of monotonic inheritance with roles Künstliche Intelligenz Artificial intelligence Computational complexity Database management |
title | On the complexity of monotonic inheritance with roles |
title_auth | On the complexity of monotonic inheritance with roles |
title_exact_search | On the complexity of monotonic inheritance with roles |
title_full | On the complexity of monotonic inheritance with roles by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham |
title_fullStr | On the complexity of monotonic inheritance with roles by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham |
title_full_unstemmed | On the complexity of monotonic inheritance with roles by Ramiro A. de T. Guerreira, Andrea S. Hemerly, Yoav Shoham |
title_short | On the complexity of monotonic inheritance with roles |
title_sort | on the complexity of monotonic inheritance with roles |
topic | Künstliche Intelligenz Artificial intelligence Computational complexity Database management |
topic_facet | Künstliche Intelligenz Artificial intelligence Computational complexity Database management |
volume_link | (DE-604)BV008928280 |
work_keys_str_mv | AT guerreiraramiroade onthecomplexityofmonotonicinheritancewithroles AT hamerlyandreas onthecomplexityofmonotonicinheritancewithroles AT shohamyoav onthecomplexityofmonotonicinheritancewithroles |