θ-subsumption and resolution: A new algorithm
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 391 |
---|---|
container_issue | |
container_start_page | 384 |
container_title | |
container_volume | |
creator | FERILLI, S DI MAURO, N BASILE, T. M. A ESPOSITO, F |
description | |
doi_str_mv | 10.1007/978-3-540-39592-8_53 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_15509263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>15509263</sourcerecordid><originalsourceid>FETCH-LOGICAL-p183t-d700c7615300c3a8a5f9fe858c0def7dfec4ce3c9221ce041520943adccdb42d3</originalsourceid><addsrcrecordid>eNotjMlKxEAURQsHsGnzBy6ycVntq3o1umsabYUGN7oO1TVoJBOpBPHP_Aq_yYjezeHC4RByxWDDAPSN1YYilQIoWmk5NZXEE7JiijGKKOwpKRYFF4EDl4qdkRUgcGq1wAtS5PwOy5AjV2pFNt9fNM_HPLfDVPdd6bpQjjH3zfx7b8tt2cWP0jWv_VhPb-0lOU-uybH455q83N897x7o4Wn_uNse6MAMTjRoAK8Vk7gQnXEy2RSNNB5CTDqk6IWP6C3nzEcQTHKwAl3wPhwFD7gm13_dwWXvmjS6zte5Gsa6deNnxaQEyxXiD4gSSxQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>θ-subsumption and resolution: A new algorithm</title><source>Springer Books</source><creator>FERILLI, S ; DI MAURO, N ; BASILE, T. M. A ; ESPOSITO, F</creator><creatorcontrib>FERILLI, S ; DI MAURO, N ; BASILE, T. M. A ; ESPOSITO, F</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540202561</identifier><identifier>ISBN: 3540202560</identifier><identifier>EISSN: 1611-3349</identifier><identifier>DOI: 10.1007/978-3-540-39592-8_53</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Learning and adaptive systems</subject><ispartof>Lecture notes in computer science, 2003, p.384-391</ispartof><rights>2004 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><link.rule.ids>309,310,780,784,789,790,4050,4051,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15509263$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>FERILLI, S</creatorcontrib><creatorcontrib>DI MAURO, N</creatorcontrib><creatorcontrib>BASILE, T. M. A</creatorcontrib><creatorcontrib>ESPOSITO, F</creatorcontrib><title>θ-subsumption and resolution: A new algorithm</title><title>Lecture notes in computer science</title><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Learning and adaptive systems</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540202561</isbn><isbn>3540202560</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotjMlKxEAURQsHsGnzBy6ycVntq3o1umsabYUGN7oO1TVoJBOpBPHP_Aq_yYjezeHC4RByxWDDAPSN1YYilQIoWmk5NZXEE7JiijGKKOwpKRYFF4EDl4qdkRUgcGq1wAtS5PwOy5AjV2pFNt9fNM_HPLfDVPdd6bpQjjH3zfx7b8tt2cWP0jWv_VhPb-0lOU-uybH455q83N897x7o4Wn_uNse6MAMTjRoAK8Vk7gQnXEy2RSNNB5CTDqk6IWP6C3nzEcQTHKwAl3wPhwFD7gm13_dwWXvmjS6zte5Gsa6deNnxaQEyxXiD4gSSxQ</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>FERILLI, S</creator><creator>DI MAURO, N</creator><creator>BASILE, T. M. A</creator><creator>ESPOSITO, F</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>θ-subsumption and resolution: A new algorithm</title><author>FERILLI, S ; DI MAURO, N ; BASILE, T. M. A ; ESPOSITO, F</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p183t-d700c7615300c3a8a5f9fe858c0def7dfec4ce3c9221ce041520943adccdb42d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Learning and adaptive systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FERILLI, S</creatorcontrib><creatorcontrib>DI MAURO, N</creatorcontrib><creatorcontrib>BASILE, T. M. A</creatorcontrib><creatorcontrib>ESPOSITO, F</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>FERILLI, S</au><au>DI MAURO, N</au><au>BASILE, T. M. A</au><au>ESPOSITO, F</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>θ-subsumption and resolution: A new algorithm</atitle><btitle>Lecture notes in computer science</btitle><date>2003</date><risdate>2003</risdate><spage>384</spage><epage>391</epage><pages>384-391</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540202561</isbn><isbn>3540202560</isbn><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/978-3-540-39592-8_53</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2003, p.384-391 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_15509263 |
source | Springer Books |
subjects | Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Learning and adaptive systems |
title | θ-subsumption and resolution: A new algorithm |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T02%3A24%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=%CE%B8-subsumption%20and%20resolution:%20A%20new%20algorithm&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=FERILLI,%20S&rft.date=2003&rft.spage=384&rft.epage=391&rft.pages=384-391&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540202561&rft.isbn_list=3540202560&rft_id=info:doi/10.1007/978-3-540-39592-8_53&rft_dat=%3Cpascalfrancis%3E15509263%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |