Integrating answer set programming and constraint logic programming
We introduce a knowledge representation language extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, , for computing answer sets of programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving...
Gespeichert in:
| Veröffentlicht in: | Annals of mathematics and artificial intelligence 2008-08, Vol.53 (1-4), p.251-287 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 287 |
|---|---|
| container_issue | 1-4 |
| container_start_page | 251 |
| container_title | Annals of mathematics and artificial intelligence |
| container_volume | 53 |
| creator | Mellarkod, Veena S. Gelfond, Michael Zhang, Yuanlin |
| description | We introduce a knowledge representation language
extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm,
, for computing answer sets of
programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The
based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm. |
| doi_str_mv | 10.1007/s10472-009-9116-y |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_919942692</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>919942692</sourcerecordid><originalsourceid>FETCH-LOGICAL-c391t-7841be3e02ec8b37de5bbbffb80c693198ef4ede016bab59a62d1e31c60c6b323</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG8FD56imaRNm6MsfiwseNFzSNJp6dKma9JF9t-bpYIieJph8rwz4SHkGtgdMFbeR2B5ySljiioASQ8nZAFFKWiZl-w09Qw45XkuzslFjFuWQFnJBVmt_YRtMFPn28z4-IkhizhluzCm6TDM4zpzo49TMJ2fsn5sO_cbuCRnjekjXn3XJXl_enxbvdDN6_N69bChTiiYaFnlYFEg4-gqK8oaC2tt09iKOakEqAqbHGtkIK2xhTKS14ACnEzvVnCxJLfz3nT7Y49x0kMXHfa98Tjuo1agVM6lOpI3f8jtuA8-fU5zBRWoIqlJFMyUC2OMARu9C91gwkED00ereraqkyx9tKoPKcPnTEysbzH8bP4_9AXe9nud</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918195573</pqid></control><display><type>article</type><title>Integrating answer set programming and constraint logic programming</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>Mellarkod, Veena S. ; Gelfond, Michael ; Zhang, Yuanlin</creator><creatorcontrib>Mellarkod, Veena S. ; Gelfond, Michael ; Zhang, Yuanlin</creatorcontrib><description>We introduce a knowledge representation language
extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm,
, for computing answer sets of
programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The
based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.</description><identifier>ISSN: 1012-2443</identifier><identifier>EISSN: 1573-7470</identifier><identifier>DOI: 10.1007/s10472-009-9116-y</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Abduction ; Algorithms ; Artificial Intelligence ; Chromium ; Complex Systems ; Computer Science ; Declarative programming ; Expert systems ; Knowledge representation ; Logic programming ; Mathematical analysis ; Mathematical programming ; Mathematics ; Programming ; Prolog ; Semantics ; Solvers</subject><ispartof>Annals of mathematics and artificial intelligence, 2008-08, Vol.53 (1-4), p.251-287</ispartof><rights>Springer Science+Business Media B.V. 2009</rights><rights>Springer Science+Business Media B.V. 2009.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c391t-7841be3e02ec8b37de5bbbffb80c693198ef4ede016bab59a62d1e31c60c6b323</citedby><cites>FETCH-LOGICAL-c391t-7841be3e02ec8b37de5bbbffb80c693198ef4ede016bab59a62d1e31c60c6b323</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10472-009-9116-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918195573?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,33745,41488,42557,43805,51319,64385,64387,64389,72469</link.rule.ids></links><search><creatorcontrib>Mellarkod, Veena S.</creatorcontrib><creatorcontrib>Gelfond, Michael</creatorcontrib><creatorcontrib>Zhang, Yuanlin</creatorcontrib><title>Integrating answer set programming and constraint logic programming</title><title>Annals of mathematics and artificial intelligence</title><addtitle>Ann Math Artif Intell</addtitle><description>We introduce a knowledge representation language
extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm,
, for computing answer sets of
programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The
based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.</description><subject>Abduction</subject><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Chromium</subject><subject>Complex Systems</subject><subject>Computer Science</subject><subject>Declarative programming</subject><subject>Expert systems</subject><subject>Knowledge representation</subject><subject>Logic programming</subject><subject>Mathematical analysis</subject><subject>Mathematical programming</subject><subject>Mathematics</subject><subject>Programming</subject><subject>Prolog</subject><subject>Semantics</subject><subject>Solvers</subject><issn>1012-2443</issn><issn>1573-7470</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG8FD56imaRNm6MsfiwseNFzSNJp6dKma9JF9t-bpYIieJph8rwz4SHkGtgdMFbeR2B5ySljiioASQ8nZAFFKWiZl-w09Qw45XkuzslFjFuWQFnJBVmt_YRtMFPn28z4-IkhizhluzCm6TDM4zpzo49TMJ2fsn5sO_cbuCRnjekjXn3XJXl_enxbvdDN6_N69bChTiiYaFnlYFEg4-gqK8oaC2tt09iKOakEqAqbHGtkIK2xhTKS14ACnEzvVnCxJLfz3nT7Y49x0kMXHfa98Tjuo1agVM6lOpI3f8jtuA8-fU5zBRWoIqlJFMyUC2OMARu9C91gwkED00ereraqkyx9tKoPKcPnTEysbzH8bP4_9AXe9nud</recordid><startdate>20080801</startdate><enddate>20080801</enddate><creator>Mellarkod, Veena S.</creator><creator>Gelfond, Michael</creator><creator>Zhang, Yuanlin</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080801</creationdate><title>Integrating answer set programming and constraint logic programming</title><author>Mellarkod, Veena S. ; Gelfond, Michael ; Zhang, Yuanlin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c391t-7841be3e02ec8b37de5bbbffb80c693198ef4ede016bab59a62d1e31c60c6b323</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Abduction</topic><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Chromium</topic><topic>Complex Systems</topic><topic>Computer Science</topic><topic>Declarative programming</topic><topic>Expert systems</topic><topic>Knowledge representation</topic><topic>Logic programming</topic><topic>Mathematical analysis</topic><topic>Mathematical programming</topic><topic>Mathematics</topic><topic>Programming</topic><topic>Prolog</topic><topic>Semantics</topic><topic>Solvers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mellarkod, Veena S.</creatorcontrib><creatorcontrib>Gelfond, Michael</creatorcontrib><creatorcontrib>Zhang, Yuanlin</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Annals of mathematics and artificial intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mellarkod, Veena S.</au><au>Gelfond, Michael</au><au>Zhang, Yuanlin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Integrating answer set programming and constraint logic programming</atitle><jtitle>Annals of mathematics and artificial intelligence</jtitle><stitle>Ann Math Artif Intell</stitle><date>2008-08-01</date><risdate>2008</risdate><volume>53</volume><issue>1-4</issue><spage>251</spage><epage>287</epage><pages>251-287</pages><issn>1012-2443</issn><eissn>1573-7470</eissn><abstract>We introduce a knowledge representation language
extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm,
, for computing answer sets of
programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The
based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s10472-009-9116-y</doi><tpages>37</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1012-2443 |
| ispartof | Annals of mathematics and artificial intelligence, 2008-08, Vol.53 (1-4), p.251-287 |
| issn | 1012-2443 1573-7470 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_919942692 |
| source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | Abduction Algorithms Artificial Intelligence Chromium Complex Systems Computer Science Declarative programming Expert systems Knowledge representation Logic programming Mathematical analysis Mathematical programming Mathematics Programming Prolog Semantics Solvers |
| title | Integrating answer set programming and constraint logic programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T19%3A48%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Integrating%20answer%20set%20programming%20and%20constraint%20logic%20programming&rft.jtitle=Annals%20of%20mathematics%20and%20artificial%20intelligence&rft.au=Mellarkod,%20Veena%20S.&rft.date=2008-08-01&rft.volume=53&rft.issue=1-4&rft.spage=251&rft.epage=287&rft.pages=251-287&rft.issn=1012-2443&rft.eissn=1573-7470&rft_id=info:doi/10.1007/s10472-009-9116-y&rft_dat=%3Cproquest_cross%3E919942692%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918195573&rft_id=info:pmid/&rfr_iscdi=true |