Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types) of the first-order language limit Datalog Z (a fragment of Da...
Uložené v:
| Vydané v: | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
29.06.2021
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types) of the first-order language limit Datalog Z (a fragment of Datalog modulo linear integer arithmetic), but can be instantiated with any suitable background theory. For example, the fragment is decidable over any countable well-quasi-order with a decidable first-order theory, such as natural number vectors under componentwise linear arithmetic, and words of a bounded, context-free language ordered by the subword relation. Formulas of initial limit Datalog have the property that, under some assumptions on the background theory, their satisfiability can be witnessed by a new kind of term model which we call entwined structures. Whilst the set of all models is typically uncountable, the set of all entwined structures is recursively enumerable, and model checking is decidable. |
|---|---|
| AbstractList | We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types) of the first-order language limit Datalog Z (a fragment of Datalog modulo linear integer arithmetic), but can be instantiated with any suitable background theory. For example, the fragment is decidable over any countable well-quasi-order with a decidable first-order theory, such as natural number vectors under componentwise linear arithmetic, and words of a bounded, context-free language ordered by the subword relation. Formulas of initial limit Datalog have the property that, under some assumptions on the background theory, their satisfiability can be witnessed by a new kind of term model which we call entwined structures. Whilst the set of all models is typically uncountable, the set of all entwined structures is recursively enumerable, and model checking is decidable. |
| Author | Ong, Luke Burn, Toby Cathcart Wagner, Dominik Ramsay, Steven |
| Author_xml | – sequence: 1 givenname: Toby Cathcart surname: Burn fullname: Burn, Toby Cathcart – sequence: 2 givenname: Luke surname: Ong fullname: Ong, Luke – sequence: 3 givenname: Steven surname: Ramsay fullname: Ramsay, Steven – sequence: 4 givenname: Dominik surname: Wagner fullname: Wagner, Dominik |
| BookMark | eNotj81KxDAUhSMoqGOfQJC8QMebpEkad9IZnULRxeh6uG1vJdJJpYmob-_frA7n4_DBOWfHYQrE2JWApRDgrpu62mopTbGUIMXSFRa0tEcsc7YUxuiiKJ02pyyL8RUAZGkFFO6Mbevgk8eRN37vE19hwnF6ueHIH-iDrz8ThejbkXg1Yox8GviKOt_jH5pCTDP6QD3fTHP43bxHihfsZMAxUnbIBXu-Wz9Vm7x5vK-r2yZHWbqUF05Dh1rbzhhh0IBUpEAbPeif3rtSUotCdaQVCEPCtnboWwW2KzvstVULdvnv9US0e5v9Huev3eG6-gY4Y1Bj |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/LICS52264.2021.9470527 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781665448956 1665448954 |
| EndPage | 13 |
| ExternalDocumentID | 9470527 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK GUFHI LHSKQ RIE RIO |
| ID | FETCH-LOGICAL-a289t-4950ca557c6616a6023e30565f5616d982eba13ce53016e17b7fdb307c8cad573 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:26:37 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-4950ca557c6616a6023e30565f5616d982eba13ce53016e17b7fdb307c8cad573 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_9470527 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-June-29 |
| PublicationDateYYYYMMDD | 2021-06-29 |
| PublicationDate_xml | – month: 06 year: 2021 text: 2021-June-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science |
| PublicationTitleAbbrev | LICS |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0002871049 |
| Score | 2.1705937 |
| Snippet | We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Computational modeling Computer science Model checking |
| Title | Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses |
| URI | https://ieeexplore.ieee.org/document/9470527 |
| WOSCitedRecordID | wos000947350400014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na8JAEB1UeujJtlr6zR56bNSs2d1sr36gICLYFm-y2UxAkKT4Ufrzu7OmlkIvvYUlS2CHybw3mZcH8JgiYoRR5LhJnARRrDHQkjuqwoU1lnMjvWfk20RNp_FioWcVeDpqYdxeP3yGLbr03_LTwu6pVdbWkeoIrqpQVUodtFrHfgohf4d2SxFw2NHtybg3J3RBnRMetsrNv1xUfBEZ1v_3-DNo_qjx2OxYZ86hgvkF1L_tGFiZnQ2Yj2kQyKyZFy2x_qEx88wMc28yNvj0s-rJGpk3wmRFxvpoV6nxSwQTyS0CUzYqNjnds9_itgmvw8FLbxSUngmBcdRpFzi-07FGCGVd4ZVGupKMxBJE5oCSTHXMMTFh16JwmS0xVInK0sQluo2tSYXqXkItL3K8AqaQU7Yq7jUksdLG2kzLKBEuolkmr6FBZ7R8P_wWY1kez83fy7dwSmGgKSuu76C22-zxHk7sx2613Tz4WH4BdPWeFQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB1qFfRUtRW_3YNH0zbb_ch6bS0txlJold7KZjOBQkmlH-LPd3cbK4IXb2HJQthhMu9N5uUB3KeIyJAxy02iJGCRwkAJaqkK5UYbSrXwnpFvsRwMoslEDUvwsNPC2L1--Azr7tJ_y08XZuNaZQ3FZJNTuQf7nDEabtVau46Kw_4W7xYy4LCpGnG_PXL4wvVOaFgvtv_yUfFlpFv53wMcQ-1Hj0eGu0pzAiXMT6HybchAivyswqjvRoH0nHjZEulsWzOPRBP7LiNPn35aPZkj8VaYZJGRDppZqv2SA4rOLwJT0lssc3fPZoWrGrx2n8btXlC4JgTakqd1YBlP02jOpbGlV2hhizI6nsAzC5VEqiKKiQ5bBrnNbYGhTGSWJjbVTWR0ymXrDMr5IsdzIBKpy1dJvYokkkobkynBEm5jmmXiAqrujKbv2x9jTIvjufx7-Q4Oe-OXeBr3B89XcORC4mauqLqG8nq5wRs4MB_r2Wp56-P6Bd8FoVw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Initial+Limit+Datalog%3A+a+New+Extensible+Class+of+Decidable+Constrained+Horn+Clauses&rft.au=Burn%2C+Toby+Cathcart&rft.au=Ong%2C+Luke&rft.au=Ramsay%2C+Steven&rft.au=Wagner%2C+Dominik&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470527&rft.externalDocID=9470527 |