Description Logic Reasoning in Prolog

Description Logic Reasoning in Prolog

We present a novel Description Logic reasoning approach, which focuses on solving the ABox instance retrieval problem when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our approach is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: LUKACSY, Gergely
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Logical, boolean and switching functions
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 464
container_issue
container_start_page 463
container_title
container_volume
creator LUKACSY, Gergely
description We present a novel Description Logic reasoning approach, which focuses on solving the ABox instance retrieval problem when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our approach is to transform the description logic knowledge base into a set of Horn-clauses forming a Prolog program.
doi_str_mv 10.1007/11799573_50
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19104736</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19104736</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-f8aef24858c06e4ca356bbbb8dc1c35b908bab1c76c0c7fd45f4738d15b373b83</originalsourceid><addsrcrecordid>eNpVkLtOw0AURJeXhAmp-AE3KSgM9_rus0QJLykSCEG92t3Y1kLwWt40_D1GoYBpppgzUwxjFwhXCKCuEZUxQpEVcMDmRmkSHEhKkvUhK1AiVkTcHP3LhDhmBRDUlVGcTtlZzu8AUCtTF2yxanIY47CLqS_XqYuhfGlcTn3suzL25fOYtqk7Zyet2-Zm_usz9nZ3-7p8qNZP94_Lm3U11Gh2Vatd09ZcCx1ANjw4EtJP0puAgYQ3oL3zGJQMEFS74aLlivQGhSdFXtOMLfa7g8vBbdvR9SFmO4zx041fFg3CVJATd7nn8hT1XTNan9JHtgj25yf75yf6BssSU84</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Description Logic Reasoning in Prolog</title><source>Springer Books</source><creator>LUKACSY, Gergely</creator><contributor>Etalle, Sandro ; Truszczyński, Mirosław</contributor><creatorcontrib>LUKACSY, Gergely ; Etalle, Sandro ; Truszczyński, Mirosław</creatorcontrib><description>We present a novel Description Logic reasoning approach, which focuses on solving the ABox instance retrieval problem when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our approach is to transform the description logic knowledge base into a set of Horn-clauses forming a Prolog program.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540366355</identifier><identifier>ISBN: 3540366350</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540366362</identifier><identifier>EISBN: 3540366369</identifier><identifier>DOI: 10.1007/11799573_50</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Logical, boolean and switching functions ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2006, p.463-464</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11799573_50$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11799573_50$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19104736$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Etalle, Sandro</contributor><contributor>Truszczyński, Mirosław</contributor><creatorcontrib>LUKACSY, Gergely</creatorcontrib><title>Description Logic Reasoning in Prolog</title><title>Lecture notes in computer science</title><description>We present a novel Description Logic reasoning approach, which focuses on solving the ABox instance retrieval problem when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our approach is to transform the description logic knowledge base into a set of Horn-clauses forming a Prolog program.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Logical, boolean and switching functions</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540366355</isbn><isbn>3540366350</isbn><isbn>9783540366362</isbn><isbn>3540366369</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpVkLtOw0AURJeXhAmp-AE3KSgM9_rus0QJLykSCEG92t3Y1kLwWt40_D1GoYBpppgzUwxjFwhXCKCuEZUxQpEVcMDmRmkSHEhKkvUhK1AiVkTcHP3LhDhmBRDUlVGcTtlZzu8AUCtTF2yxanIY47CLqS_XqYuhfGlcTn3suzL25fOYtqk7Zyet2-Zm_usz9nZ3-7p8qNZP94_Lm3U11Gh2Vatd09ZcCx1ANjw4EtJP0puAgYQ3oL3zGJQMEFS74aLlivQGhSdFXtOMLfa7g8vBbdvR9SFmO4zx041fFg3CVJATd7nn8hT1XTNan9JHtgj25yf75yf6BssSU84</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>LUKACSY, Gergely</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Description Logic Reasoning in Prolog</title><author>LUKACSY, Gergely</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-f8aef24858c06e4ca356bbbb8dc1c35b908bab1c76c0c7fd45f4738d15b373b83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Logical, boolean and switching functions</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>LUKACSY, Gergely</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>LUKACSY, Gergely</au><au>Etalle, Sandro</au><au>Truszczyński, Mirosław</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Description Logic Reasoning in Prolog</atitle><btitle>Lecture notes in computer science</btitle><date>2006</date><risdate>2006</risdate><spage>463</spage><epage>464</epage><pages>463-464</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540366355</isbn><isbn>3540366350</isbn><eisbn>9783540366362</eisbn><eisbn>3540366369</eisbn><abstract>We present a novel Description Logic reasoning approach, which focuses on solving the ABox instance retrieval problem when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our approach is to transform the description logic knowledge base into a set of Horn-clauses forming a Prolog program.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11799573_50</doi><tpages>2</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2006, p.463-464
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_19104736
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Logical, boolean and switching functions
Theoretical computing
title Description Logic Reasoning in Prolog
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T19%3A47%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Description%20Logic%20Reasoning%20in%20Prolog&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=LUKACSY,%20Gergely&rft.date=2006&rft.spage=463&rft.epage=464&rft.pages=463-464&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540366355&rft.isbn_list=3540366350&rft_id=info:doi/10.1007/11799573_50&rft_dat=%3Cpascalfrancis_sprin%3E19104736%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540366362&rft.eisbn_list=3540366369&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true