Handling Implication and Universal Quantification Constraints in FLUX
FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 681 |
|---|---|
| container_issue | |
| container_start_page | 667 |
| container_title | |
| container_volume | 3709 |
| creator | Thielscher, Michael |
| description | FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus. |
| doi_str_mv | 10.1007/11564751_49 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_17324843</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3067971_53_686</sourcerecordid><originalsourceid>FETCH-LOGICAL-p263t-8008aa368f3e6cc98788ce1a912f93bcdc15d120dd92ecf2139c83f3657cbc933</originalsourceid><addsrcrecordid>eNpNkE1LAzEQhuMnrrUn_8BePHhYzWQ22eQopdVCQQQL3kKazdboNrtutoL_3i2t4FwG5nl4YV5CroHeAaXFPQAXecFB5-qIXCLPKTLKaX5MEhAAGWKuTvaAKYYSTklCkbJMFTmek4QJJiRQxi_IOMYPOgyC4kwmZPpkQln7sE7nm7b21vS-CelwS5fBf7sumjp92ZrQ--oPTpoQ-8740MfUh3S2WL5dkbPK1NGND3tElrPp6-QpWzw_zicPi6xlAvtMUiqNQSErdMJaJQsprQOjgFUKV7a0wEtgtCwVc7ZigMpKrFDwwq6sQhyRm31ua6I1ddWZYH3Ubec3pvvRUCDLZb7zbvdeHFBYu06vmuYzaqB6V6j-V-jg4iGza762Lvba7WTrwvBkbd9N2w81aKSiUAVojlpIgb_LxHJG</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3067971_53_686</pqid></control><display><type>book_chapter</type><title>Handling Implication and Universal Quantification Constraints in FLUX</title><source>Springer Books</source><creator>Thielscher, Michael</creator><contributor>van Beek, Peter ; van Beek, Peter</contributor><creatorcontrib>Thielscher, Michael ; van Beek, Peter ; van Beek, Peter</creatorcontrib><description>FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus.</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540292381</identifier><identifier>ISBN: 9783540292388</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320504</identifier><identifier>EISBN: 9783540320500</identifier><identifier>DOI: 10.1007/11564751_49</identifier><identifier>OCLC: 262681025</identifier><identifier>LCCallNum: QA76.758</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Constraint Solver ; Domain Constraint ; Exact sciences and technology ; Frame Problem ; Problem solving, game playing ; Situation Calculus ; Unit Resolution</subject><ispartof>Lecture notes in computer science, 2005, Vol.3709, p.667-681</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3067971-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11564751_49$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11564751_49$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17324843$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>van Beek, Peter</contributor><contributor>van Beek, Peter</contributor><creatorcontrib>Thielscher, Michael</creatorcontrib><title>Handling Implication and Universal Quantification Constraints in FLUX</title><title>Lecture notes in computer science</title><description>FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Constraint Solver</subject><subject>Domain Constraint</subject><subject>Exact sciences and technology</subject><subject>Frame Problem</subject><subject>Problem solving, game playing</subject><subject>Situation Calculus</subject><subject>Unit Resolution</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540292381</isbn><isbn>9783540292388</isbn><isbn>3540320504</isbn><isbn>9783540320500</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNkE1LAzEQhuMnrrUn_8BePHhYzWQ22eQopdVCQQQL3kKazdboNrtutoL_3i2t4FwG5nl4YV5CroHeAaXFPQAXecFB5-qIXCLPKTLKaX5MEhAAGWKuTvaAKYYSTklCkbJMFTmek4QJJiRQxi_IOMYPOgyC4kwmZPpkQln7sE7nm7b21vS-CelwS5fBf7sumjp92ZrQ--oPTpoQ-8740MfUh3S2WL5dkbPK1NGND3tElrPp6-QpWzw_zicPi6xlAvtMUiqNQSErdMJaJQsprQOjgFUKV7a0wEtgtCwVc7ZigMpKrFDwwq6sQhyRm31ua6I1ddWZYH3Ubec3pvvRUCDLZb7zbvdeHFBYu06vmuYzaqB6V6j-V-jg4iGza762Lvba7WTrwvBkbd9N2w81aKSiUAVojlpIgb_LxHJG</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Thielscher, Michael</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Handling Implication and Universal Quantification Constraints in FLUX</title><author>Thielscher, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p263t-8008aa368f3e6cc98788ce1a912f93bcdc15d120dd92ecf2139c83f3657cbc933</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Constraint Solver</topic><topic>Domain Constraint</topic><topic>Exact sciences and technology</topic><topic>Frame Problem</topic><topic>Problem solving, game playing</topic><topic>Situation Calculus</topic><topic>Unit Resolution</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Thielscher, Michael</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Thielscher, Michael</au><au>van Beek, Peter</au><au>van Beek, Peter</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Handling Implication and Universal Quantification Constraints in FLUX</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><volume>3709</volume><spage>667</spage><epage>681</epage><pages>667-681</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540292381</isbn><isbn>9783540292388</isbn><eisbn>3540320504</eisbn><eisbn>9783540320500</eisbn><abstract>FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/11564751_49</doi><oclcid>262681025</oclcid><tpages>15</tpages><edition>1ère éd</edition></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, Vol.3709, p.667-681 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17324843 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Computer science control theory systems Constraint Solver Domain Constraint Exact sciences and technology Frame Problem Problem solving, game playing Situation Calculus Unit Resolution |
| title | Handling Implication and Universal Quantification Constraints in FLUX |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-11T17%3A32%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Handling%20Implication%20and%20Universal%20Quantification%20Constraints%20in%20FLUX&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Thielscher,%20Michael&rft.date=2005&rft.volume=3709&rft.spage=667&rft.epage=681&rft.pages=667-681&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540292381&rft.isbn_list=9783540292388&rft_id=info:doi/10.1007/11564751_49&rft_dat=%3Cproquest_pasca%3EEBC3067971_53_686%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320504&rft.eisbn_list=9783540320500&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3067971_53_686&rft_id=info:pmid/&rfr_iscdi=true |