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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autoři: Burn, Toby Cathcart, Ong, Luke, Ramsay, Steven, Wagner, Dominik
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 29.06.2021
Témata:
Computational modeling
Computer science
Model checking
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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 Electronic Library (IEL)
  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.1705687
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/eLvHCXMwlV1LSwMxEB7a4sFT1VZ8k4NHt91XNhuvfdCClEIVeit5TKBQdqUP8eebZNeK4MXbMuyykGEy30zmywfwqHmGUnJ0tA8ZpCrLAyk1CyKRxMYYlZm0Eptgs1m-XPJ5A56OXBhE9MNn2HOP_ixfl-rgWmV9nrKQxqwJTcayiqt17Kc45G_Rbk0CjkLef5kOFg5duM5JHPXqj3-pqPgkMm7_7_dn0P1h45H5Mc-cQwOLC2h_yzGQOjo7sJi6QSCxIZ60RIZVY-aZCGJ3MjL69LPqcoPEC2GS0pAhqrUW3uRgolOLQE0m5bZw7xx2uOvC23j0OpgEtWZCIGzptA9svRMqQSlTNvFmIrMpGV2VQI0FSpnmeYxSRIlCaiM7w4hJZrS0ga5yJTRlySW0irLAKyAiyUNug0gxplKTWIe6M8EUqYxkInJ6DR23Rqv36lqMVb08N3-bb-HUucFNWcX8Dlr77QHv4UR97Ne77YP35ReB0p8P
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61Cnqq2opvc_DotvvKZuO1D1qspdAKvZUkO4FC2ZU-xJ9vJl0rghdvy7ALS4bJfDOZLx8hj5lIQCkBSPtQXqyT1FMq414go9AYoxMT78Qm-GiUzmZiXCFPey4MALjhM2jiozvLzwq9xVZZS8TcZyE_IIeonFWytfYdFcT-Fu-WNODAF63hoD1BfIG9kzBolp__0lFxaaRX-98PnJLGDx-PjveZ5oxUID8ntW9BBlrGZ51MBjgKJJfU0ZZoZ9eaeaaS2r2Mdj_dtLpaAnVSmLQwtAN6kUlnQqCIehGQ0X6xyvGd7RrWDfLW607bfa9UTfCkLZ42nq14fC0Z49qm3kQmNikD1gnMWKiUZCINQckg0sBsbCcQcMVNpmyo61TLjPHoglTzIodLQmWU-sKGkeZcxyayLsVTwRiYClQkU3ZF6rhG8_fdxRjzcnmu_zY_kOP-9HU4Hw5GLzfkBF2CM1ehuCXVzWoLd-RIf2wW69W98-sX_T-iWA
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