Inf-datalog, Modal Logic and Complexities
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (var...
Gespeichert in:
| Veröffentlicht in: | RAIRO. Informatique théorique et applications 2009-01, Vol.43 (1), p.1-21 |
|---|---|
| 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 | 21 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | RAIRO. Informatique théorique et applications |
| container_volume | 43 |
| creator | Foustoucos, Eugénie Guessarian, Irène |
| description | Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal μ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµk (modal μ-calculus with fixed alternation-depth at most k). |
| doi_str_mv | 10.1051/ita:2007043 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_36081782</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2489948991</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-d7d1cea83f3649805fca298f77952369f20d94760bcebfe5a449e225956cd88f3</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWKsn_8AiKIiuTpLNJvEmxY-WFhH8uoU0m5St201NtlD_vZEWD85lDvO8L8OD0DGGKwwMX9edviEAHAq6g3qYSMipYB-7qAdSiJxyVuyjgxjnAIDT9ND5sHV5pTvd-NllNvGVbrKxn9Um022VDfxi2dh13dU2HqI9p5toj7a7j17v714Gj_n46WE4uB3nhrKiyyteYWO1oI6WhRTAnNFECse5ZISW0hGoZMFLmBo7dZbpopCWECZZaSohHO2js03vMvivlY2dWtTR2KbRrfWrqGgJAnNBEnjyD5z7VWjTb0pISYAyYAm62EAm-BiDdWoZ6oUO3wqD-nWmkjO1dZbo022ljkY3LujW1PEvQkBiwkAmLt9wdezs-u-uw6cqebKsBLyr5xEfvY1goiT9AeLzeDc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>899203505</pqid></control><display><type>article</type><title>Inf-datalog, Modal Logic and Complexities</title><source>NUMDAM</source><creator>Foustoucos, Eugénie ; Guessarian, Irène</creator><creatorcontrib>Foustoucos, Eugénie ; Guessarian, Irène</creatorcontrib><description>Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal μ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµk (modal μ-calculus with fixed alternation-depth at most k).</description><identifier>ISSN: 0988-3754</identifier><identifier>EISSN: 1290-385X</identifier><identifier>DOI: 10.1051/ita:2007043</identifier><identifier>CODEN: RITAE4</identifier><language>eng</language><publisher>Les Ulis: EDP Sciences</publisher><subject>03C13 ; 68Q19 ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Functional analysis ; General logic ; Language theory and syntactical analysis ; Logic and foundations ; Mathematical analysis ; Mathematical logic, foundations, set theory ; Mathematics ; Miscellaneous ; model-checking ; performance evaluation ; Sciences and techniques of general use ; specification languages ; Theoretical computing</subject><ispartof>RAIRO. Informatique théorique et applications, 2009-01, Vol.43 (1), p.1-21</ispartof><rights>2009 INIST-CNRS</rights><rights>EDP Sciences, 2008</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c354t-d7d1cea83f3649805fca298f77952369f20d94760bcebfe5a449e225956cd88f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010,27900,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20912509$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Foustoucos, Eugénie</creatorcontrib><creatorcontrib>Guessarian, Irène</creatorcontrib><title>Inf-datalog, Modal Logic and Complexities</title><title>RAIRO. Informatique théorique et applications</title><description>Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal μ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµk (modal μ-calculus with fixed alternation-depth at most k).</description><subject>03C13</subject><subject>68Q19</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Functional analysis</subject><subject>General logic</subject><subject>Language theory and syntactical analysis</subject><subject>Logic and foundations</subject><subject>Mathematical analysis</subject><subject>Mathematical logic, foundations, set theory</subject><subject>Mathematics</subject><subject>Miscellaneous</subject><subject>model-checking</subject><subject>performance evaluation</subject><subject>Sciences and techniques of general use</subject><subject>specification languages</subject><subject>Theoretical computing</subject><issn>0988-3754</issn><issn>1290-385X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNpdkE1LAzEQhoMoWKsn_8AiKIiuTpLNJvEmxY-WFhH8uoU0m5St201NtlD_vZEWD85lDvO8L8OD0DGGKwwMX9edviEAHAq6g3qYSMipYB-7qAdSiJxyVuyjgxjnAIDT9ND5sHV5pTvd-NllNvGVbrKxn9Um022VDfxi2dh13dU2HqI9p5toj7a7j17v714Gj_n46WE4uB3nhrKiyyteYWO1oI6WhRTAnNFECse5ZISW0hGoZMFLmBo7dZbpopCWECZZaSohHO2js03vMvivlY2dWtTR2KbRrfWrqGgJAnNBEnjyD5z7VWjTb0pISYAyYAm62EAm-BiDdWoZ6oUO3wqD-nWmkjO1dZbo022ljkY3LujW1PEvQkBiwkAmLt9wdezs-u-uw6cqebKsBLyr5xEfvY1goiT9AeLzeDc</recordid><startdate>200901</startdate><enddate>200901</enddate><creator>Foustoucos, Eugénie</creator><creator>Guessarian, Irène</creator><general>EDP Sciences</general><scope>BSCLL</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200901</creationdate><title>Inf-datalog, Modal Logic and Complexities</title><author>Foustoucos, Eugénie ; Guessarian, Irène</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-d7d1cea83f3649805fca298f77952369f20d94760bcebfe5a449e225956cd88f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>03C13</topic><topic>68Q19</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Functional analysis</topic><topic>General logic</topic><topic>Language theory and syntactical analysis</topic><topic>Logic and foundations</topic><topic>Mathematical analysis</topic><topic>Mathematical logic, foundations, set theory</topic><topic>Mathematics</topic><topic>Miscellaneous</topic><topic>model-checking</topic><topic>performance evaluation</topic><topic>Sciences and techniques of general use</topic><topic>specification languages</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Foustoucos, Eugénie</creatorcontrib><creatorcontrib>Guessarian, Irène</creatorcontrib><collection>Istex</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>RAIRO. Informatique théorique et applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Foustoucos, Eugénie</au><au>Guessarian, Irène</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Inf-datalog, Modal Logic and Complexities</atitle><jtitle>RAIRO. Informatique théorique et applications</jtitle><date>2009-01</date><risdate>2009</risdate><volume>43</volume><issue>1</issue><spage>1</spage><epage>21</epage><pages>1-21</pages><issn>0988-3754</issn><eissn>1290-385X</eissn><coden>RITAE4</coden><abstract>Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal μ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµk (modal μ-calculus with fixed alternation-depth at most k).</abstract><cop>Les Ulis</cop><pub>EDP Sciences</pub><doi>10.1051/ita:2007043</doi><tpages>21</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0988-3754 |
| ispartof | RAIRO. Informatique théorique et applications, 2009-01, Vol.43 (1), p.1-21 |
| issn | 0988-3754 1290-385X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_36081782 |
| source | NUMDAM |
| subjects | 03C13 68Q19 Applied sciences Computer science control theory systems Exact sciences and technology Functional analysis General logic Language theory and syntactical analysis Logic and foundations Mathematical analysis Mathematical logic, foundations, set theory Mathematics Miscellaneous model-checking performance evaluation Sciences and techniques of general use specification languages Theoretical computing |
| title | Inf-datalog, Modal Logic and Complexities |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T15%3A12%3A36IST&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=Inf-datalog,%20Modal%20Logic%20and%20Complexities&rft.jtitle=RAIRO.%20Informatique%20the%CC%81orique%20et%20applications&rft.au=Foustoucos,%20Eug%C3%A9nie&rft.date=2009-01&rft.volume=43&rft.issue=1&rft.spage=1&rft.epage=21&rft.pages=1-21&rft.issn=0988-3754&rft.eissn=1290-385X&rft.coden=RITAE4&rft_id=info:doi/10.1051/ita:2007043&rft_dat=%3Cproquest_cross%3E2489948991%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=899203505&rft_id=info:pmid/&rfr_iscdi=true |