Some Progress in Satisfiability Checking for Difference Logic
In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 276 |
|---|---|
| container_issue | |
| container_start_page | 263 |
| container_title | |
| container_volume | |
| creator | Cotton, Scott Asarin, Eugene Maler, Oded Niebert, Peter |
| description | In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems. |
| doi_str_mv | 10.1007/978-3-540-30206-3_19 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16335639</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16335639</sourcerecordid><originalsourceid>FETCH-LOGICAL-p274t-f87a3f00a75987f411add33af5f758ba1a455e41043c91f8dc72affd1e149c273</originalsourceid><addsrcrecordid>eNo9kLtOAzEQRc1LIgr5A4ptKA0ej71eFxQoPKVIIAVqy_Hai0myG9lp8vc4CWKaK917NMUh5BrYLTCm7rRqKFIpGEXGWU3RgD4hk1JjKQ8dnpIR1AAUUeiz_40j1Eqdk9GeoloJvCSTnH9YOZCKCz0i9_Nh7auPNHTJ51zFvprbbcwh2kVcxe2umn57t4x9V4UhVY8xBJ9873w1G7rorshFsKvsJ385Jl_PT5_TVzp7f3mbPszohiuxpaFRFgNjVkndqCAAbNsi2iCDks3CghVSegFMoNMQmtYpbkNowYPQjisck5vj343Nzq5Csr2L2WxSXNu0M1Ajyhp14fiRy2XqO5_MYhiW2QAze5emiDFoihpz8Gb2LvEXq19g4Q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Some Progress in Satisfiability Checking for Difference Logic</title><source>Springer Books</source><creator>Cotton, Scott ; Asarin, Eugene ; Maler, Oded ; Niebert, Peter</creator><contributor>Yovine, Sergio ; Lakhnech, Yassine</contributor><creatorcontrib>Cotton, Scott ; Asarin, Eugene ; Maler, Oded ; Niebert, Peter ; Yovine, Sergio ; Lakhnech, Yassine</creatorcontrib><description>In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540231677</identifier><identifier>ISBN: 3540231676</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540302063</identifier><identifier>EISBN: 3540302069</identifier><identifier>DOI: 10.1007/978-3-540-30206-3_19</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Bound Model Check ; Computer science; control theory; systems ; Constraint Graph ; Difference Logic ; Exact sciences and technology ; Logical, boolean and switching functions ; Negative Cycle ; Satisfying Assignment ; Theoretical computing</subject><ispartof>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, 2004, p.263-276</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30206-3_19$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30206-3_19$$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&idt=16335639$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yovine, Sergio</contributor><contributor>Lakhnech, Yassine</contributor><creatorcontrib>Cotton, Scott</creatorcontrib><creatorcontrib>Asarin, Eugene</creatorcontrib><creatorcontrib>Maler, Oded</creatorcontrib><creatorcontrib>Niebert, Peter</creatorcontrib><title>Some Progress in Satisfiability Checking for Difference Logic</title><title>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems</title><description>In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems.</description><subject>Applied sciences</subject><subject>Bound Model Check</subject><subject>Computer science; control theory; systems</subject><subject>Constraint Graph</subject><subject>Difference Logic</subject><subject>Exact sciences and technology</subject><subject>Logical, boolean and switching functions</subject><subject>Negative Cycle</subject><subject>Satisfying Assignment</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540231677</isbn><isbn>3540231676</isbn><isbn>9783540302063</isbn><isbn>3540302069</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9kLtOAzEQRc1LIgr5A4ptKA0ej71eFxQoPKVIIAVqy_Hai0myG9lp8vc4CWKaK917NMUh5BrYLTCm7rRqKFIpGEXGWU3RgD4hk1JjKQ8dnpIR1AAUUeiz_40j1Eqdk9GeoloJvCSTnH9YOZCKCz0i9_Nh7auPNHTJ51zFvprbbcwh2kVcxe2umn57t4x9V4UhVY8xBJ9873w1G7rorshFsKvsJ385Jl_PT5_TVzp7f3mbPszohiuxpaFRFgNjVkndqCAAbNsi2iCDks3CghVSegFMoNMQmtYpbkNowYPQjisck5vj343Nzq5Csr2L2WxSXNu0M1Ajyhp14fiRy2XqO5_MYhiW2QAze5emiDFoihpz8Gb2LvEXq19g4Q</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Cotton, Scott</creator><creator>Asarin, Eugene</creator><creator>Maler, Oded</creator><creator>Niebert, Peter</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Some Progress in Satisfiability Checking for Difference Logic</title><author>Cotton, Scott ; Asarin, Eugene ; Maler, Oded ; Niebert, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p274t-f87a3f00a75987f411add33af5f758ba1a455e41043c91f8dc72affd1e149c273</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Bound Model Check</topic><topic>Computer science; control theory; systems</topic><topic>Constraint Graph</topic><topic>Difference Logic</topic><topic>Exact sciences and technology</topic><topic>Logical, boolean and switching functions</topic><topic>Negative Cycle</topic><topic>Satisfying Assignment</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cotton, Scott</creatorcontrib><creatorcontrib>Asarin, Eugene</creatorcontrib><creatorcontrib>Maler, Oded</creatorcontrib><creatorcontrib>Niebert, Peter</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cotton, Scott</au><au>Asarin, Eugene</au><au>Maler, Oded</au><au>Niebert, Peter</au><au>Yovine, Sergio</au><au>Lakhnech, Yassine</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Some Progress in Satisfiability Checking for Difference Logic</atitle><btitle>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><spage>263</spage><epage>276</epage><pages>263-276</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540231677</isbn><isbn>3540231676</isbn><eisbn>9783540302063</eisbn><eisbn>3540302069</eisbn><abstract>In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30206-3_19</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, 2004, p.263-276 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16335639 |
| source | Springer Books |
| subjects | Applied sciences Bound Model Check Computer science control theory systems Constraint Graph Difference Logic Exact sciences and technology Logical, boolean and switching functions Negative Cycle Satisfying Assignment Theoretical computing |
| title | Some Progress in Satisfiability Checking for Difference Logic |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T04%3A35%3A56IST&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=bookitem&rft.atitle=Some%20Progress%20in%20Satisfiability%20Checking%20for%20Difference%20Logic&rft.btitle=Formal%20Techniques,%20Modelling%20and%20Analysis%20of%20Timed%20and%20Fault-Tolerant%20Systems&rft.au=Cotton,%20Scott&rft.date=2004&rft.spage=263&rft.epage=276&rft.pages=263-276&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540231677&rft.isbn_list=3540231676&rft_id=info:doi/10.1007/978-3-540-30206-3_19&rft_dat=%3Cpascalfrancis_sprin%3E16335639%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540302063&rft.eisbn_list=3540302069&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |