Functional lattices for taxonomic reasoning:
Abstract: "Taken in the abstract, taxonomies, a key subject of knowledge representation languages, are partial order relations and a good way to deal with them is to embed them inside a complete distributive lattice. If we take the semantics as a guide for the design of these languages, nothing...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
593 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Taken in the abstract, taxonomies, a key subject of knowledge representation languages, are partial order relations and a good way to deal with them is to embed them inside a complete distributive lattice. If we take the semantics as a guide for the design of these languages, nothing suggests the separation made in the syntax of most of them between objects (singletons) and concepts (the rest of sets). On the contrary, it seems natural to define functions and relations operating on all elements of the lattice and not only on objects as frequently happens in KRL. The language TERMCOR presented here is based on three main ideas. Firstly, no distinction is made between concepts (types) and objects (values): we have only one kind of expression to represent both. Secondly, concepts and functions are viewed without distinction as elements of the same reflexive lattice. Reflexivity allows the definition of two powerful recursion operators which we have used to handle with terminological cycles, but losing the decidability property. Thirdly, conceptual taxonomies are represented by sets of conditional subsumptions on which a complete subsumption algorithm operates. As stated below, similar ideas have appeared separatedly in different frameworks; putting these ideas together in TERMCOR we believe to address simply and directly the basic expressivity needs of taxonomic KRL. We have translated some constructs of TF directly to TERMCOR to show this expressivity. Other expressions have no direct translation and we must use the expressivity of our language in other ways as our example shows." |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010459841 | ||
| 003 | DE-604 | ||
| 005 | 20041228 | ||
| 007 | t | ||
| 008 | 951031s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)32223097 | ||
| 035 | |a (DE-599)BVBBV010459841 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Levy, Jordi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Functional lattices for taxonomic reasoning |c Jordi Levy, Jaume Agustí and Felip Mañá |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 593 | |
| 520 | 3 | |a Abstract: "Taken in the abstract, taxonomies, a key subject of knowledge representation languages, are partial order relations and a good way to deal with them is to embed them inside a complete distributive lattice. If we take the semantics as a guide for the design of these languages, nothing suggests the separation made in the syntax of most of them between objects (singletons) and concepts (the rest of sets). On the contrary, it seems natural to define functions and relations operating on all elements of the lattice and not only on objects as frequently happens in KRL. The language TERMCOR presented here is based on three main ideas. Firstly, no distinction is made between concepts (types) and objects (values): we have only one kind of expression to represent both. Secondly, concepts and functions are viewed without distinction as elements of the same reflexive lattice. Reflexivity allows the definition of two powerful recursion operators which we have used to handle with terminological cycles, but losing the decidability property. Thirdly, conceptual taxonomies are represented by sets of conditional subsumptions on which a complete subsumption algorithm operates. As stated below, similar ideas have appeared separatedly in different frameworks; putting these ideas together in TERMCOR we believe to address simply and directly the basic expressivity needs of taxonomic KRL. We have translated some constructs of TF directly to TERMCOR to show this expressivity. Other expressions have no direct translation and we must use the expressivity of our language in other ways as our example shows." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Knowledge representation (Information theory) | |
| 700 | 1 | |a Agustí i Cullell, Jaume |e Verfasser |4 aut | |
| 700 | 1 | |a Mañá, Felip |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 593 |w (DE-604)BV010450646 |9 593 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006968804 | ||
Datensatz im Suchindex
| _version_ | 1804124890966523904 |
|---|---|
| any_adam_object | |
| author | Levy, Jordi Agustí i Cullell, Jaume Mañá, Felip |
| author_facet | Levy, Jordi Agustí i Cullell, Jaume Mañá, Felip |
| author_role | aut aut aut |
| author_sort | Levy, Jordi |
| author_variant | j l jl i c j a icj icja f m fm |
| building | Verbundindex |
| bvnumber | BV010459841 |
| ctrlnum | (OCoLC)32223097 (DE-599)BVBBV010459841 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02792nam a2200337 cb4500</leader><controlfield tag="001">BV010459841</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951031s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32223097</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010459841</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Levy, Jordi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Functional lattices for taxonomic reasoning</subfield><subfield code="c">Jordi Levy, Jaume Agustí and Felip Mañá</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">593</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Taken in the abstract, taxonomies, a key subject of knowledge representation languages, are partial order relations and a good way to deal with them is to embed them inside a complete distributive lattice. If we take the semantics as a guide for the design of these languages, nothing suggests the separation made in the syntax of most of them between objects (singletons) and concepts (the rest of sets). On the contrary, it seems natural to define functions and relations operating on all elements of the lattice and not only on objects as frequently happens in KRL. The language TERMCOR presented here is based on three main ideas. Firstly, no distinction is made between concepts (types) and objects (values): we have only one kind of expression to represent both. Secondly, concepts and functions are viewed without distinction as elements of the same reflexive lattice. Reflexivity allows the definition of two powerful recursion operators which we have used to handle with terminological cycles, but losing the decidability property. Thirdly, conceptual taxonomies are represented by sets of conditional subsumptions on which a complete subsumption algorithm operates. As stated below, similar ideas have appeared separatedly in different frameworks; putting these ideas together in TERMCOR we believe to address simply and directly the basic expressivity needs of taxonomic KRL. We have translated some constructs of TF directly to TERMCOR to show this expressivity. Other expressions have no direct translation and we must use the expressivity of our language in other ways as our example shows."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge representation (Information theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Agustí i Cullell, Jaume</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mañá, Felip</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">593</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">593</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006968804</subfield></datafield></record></collection> |
| id | DE-604.BV010459841 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006968804 |
| oclc_num | 32223097 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Levy, Jordi Verfasser aut Functional lattices for taxonomic reasoning Jordi Levy, Jaume Agustí and Felip Mañá Edinburgh 1992 12 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 593 Abstract: "Taken in the abstract, taxonomies, a key subject of knowledge representation languages, are partial order relations and a good way to deal with them is to embed them inside a complete distributive lattice. If we take the semantics as a guide for the design of these languages, nothing suggests the separation made in the syntax of most of them between objects (singletons) and concepts (the rest of sets). On the contrary, it seems natural to define functions and relations operating on all elements of the lattice and not only on objects as frequently happens in KRL. The language TERMCOR presented here is based on three main ideas. Firstly, no distinction is made between concepts (types) and objects (values): we have only one kind of expression to represent both. Secondly, concepts and functions are viewed without distinction as elements of the same reflexive lattice. Reflexivity allows the definition of two powerful recursion operators which we have used to handle with terminological cycles, but losing the decidability property. Thirdly, conceptual taxonomies are represented by sets of conditional subsumptions on which a complete subsumption algorithm operates. As stated below, similar ideas have appeared separatedly in different frameworks; putting these ideas together in TERMCOR we believe to address simply and directly the basic expressivity needs of taxonomic KRL. We have translated some constructs of TF directly to TERMCOR to show this expressivity. Other expressions have no direct translation and we must use the expressivity of our language in other ways as our example shows." Bionics and artificial intelligence sigle Computer software sigle Knowledge representation (Information theory) Agustí i Cullell, Jaume Verfasser aut Mañá, Felip Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 593 (DE-604)BV010450646 593 |
| spellingShingle | Levy, Jordi Agustí i Cullell, Jaume Mañá, Felip Functional lattices for taxonomic reasoning Bionics and artificial intelligence sigle Computer software sigle Knowledge representation (Information theory) |
| title | Functional lattices for taxonomic reasoning |
| title_auth | Functional lattices for taxonomic reasoning |
| title_exact_search | Functional lattices for taxonomic reasoning |
| title_full | Functional lattices for taxonomic reasoning Jordi Levy, Jaume Agustí and Felip Mañá |
| title_fullStr | Functional lattices for taxonomic reasoning Jordi Levy, Jaume Agustí and Felip Mañá |
| title_full_unstemmed | Functional lattices for taxonomic reasoning Jordi Levy, Jaume Agustí and Felip Mañá |
| title_short | Functional lattices for taxonomic reasoning |
| title_sort | functional lattices for taxonomic reasoning |
| topic | Bionics and artificial intelligence sigle Computer software sigle Knowledge representation (Information theory) |
| topic_facet | Bionics and artificial intelligence Computer software Knowledge representation (Information theory) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT levyjordi functionallatticesfortaxonomicreasoning AT agustiicullelljaume functionallatticesfortaxonomicreasoning AT manafelip functionallatticesfortaxonomicreasoning |