Verifying Tight Logic Programs with anthem and vampire

This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship bet...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 20; no. 5; pp. 735 - 750
Main Authors: FANDINNO, JORGE, LIFSCHITZ, VLADIMIR, LÜHNE, PATRICK, SCHAUB, TORSTEN
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.09.2020
Subjects:
Logic programs
Original Article
Semantics
Software
Software development tools
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
AbstractList This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
Author LÜHNE, PATRICK
LIFSCHITZ, VLADIMIR
FANDINNO, JORGE
SCHAUB, TORSTEN
Author_xml – sequence: 1
  givenname: JORGE
  orcidid: 0000-0002-3917-8717
  surname: FANDINNO
  fullname: FANDINNO, JORGE
  organization: University of Potsdam, Germany
– sequence: 2
  givenname: VLADIMIR
  orcidid: 0000-0001-6051-7907
  surname: LIFSCHITZ
  fullname: LIFSCHITZ, VLADIMIR
  organization: University of Texas at Austin, USA
– sequence: 3
  givenname: PATRICK
  orcidid: 0000-0001-5902-4152
  surname: LÜHNE
  fullname: LÜHNE, PATRICK
  organization: University of Potsdam, Germany
– sequence: 4
  givenname: TORSTEN
  orcidid: 0000-0002-7456-041X
  surname: SCHAUB
  fullname: SCHAUB, TORSTEN
  organization: University of Potsdam, Germany
BookMark eNp9kE1LAzEQhoNUsK3-AG8Lnlcnn7sepagVCgpWr0u6SbYp3c2apEr_vaktCIrOZYZ35pmvERp0rtMInWO4xICLq2fMCgyiZASSUcaO0DBJPKdQ4sFXjPNd_gSNQlgBYEEJGyLxqr01W9s12dw2y5jNXGPr7Mm7xss2ZB82LjPZxaVuk1PZu2x76_UpOjZyHfTZwY_Ry93tfDLNZ4_3D5ObWV5TATHXnJXc0FLhQkFSOBayVCoteS1lIRQA54YbYAIIcL1YUFUwwqQwlHOa7hiji33f3ru3jQ6xWrmN79LIijDGCGcAJFUV-6rauxC8NlVto4zWddFLu64wVLsnVb-elEj8g-y9baXf_svQAyPbhbeq0d9L_U19ArFwdq8
CitedBy_id crossref_primary_10_1017_S1471068424000103
crossref_primary_10_1017_S1471068421000338
crossref_primary_10_1017_S1471068423000200
crossref_primary_10_1017_S147106842300039X
crossref_primary_10_1017_S1471068421000478
crossref_primary_10_1017_S1471068423000224
crossref_primary_10_1017_S1471068425100112
Cites_doi 10.1142/S0218194096000053
10.1017/S1471068417000394
10.1017/S1471068403001765
10.1145/2043174.2043195
10.1007/s10817-017-9407-7
10.1016/j.artint.2017.02.002
10.1017/S1471068415000150
10.1017/S1471068420000265
10.1093/logcom/exn039
10.1016/j.artint.2010.04.011
ContentType Journal Article
Copyright The Author(s), 2020. Published by Cambridge University Press
Copyright_xml – notice: The Author(s), 2020. Published by Cambridge University Press
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068420000344
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList Computer Science Database
CrossRef
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 750
ExternalDocumentID 10_1017_S1471068420000344
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAEED
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABMYL
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABZCX
ACBMC
ACCHT
ACGFS
ACIMK
ACNCT
ACQFJ
ACREK
ACUIJ
ACUYZ
ACWGA
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADGEJ
ADKIL
ADOCW
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFKSM
AFLOS
AFLVW
AFUTZ
AGABE
AGBYD
AGJUD
AGOOT
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WXY
WYP
ZYDXJ
AAYXX
ABGDZ
ABVKB
ABVZP
ABXHF
ACAJB
ACDLN
AFFHD
AFZFC
AKMAY
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
PUEGO
Q9U
ID FETCH-LOGICAL-c360t-e5485f38d17d0360516a8dd4209aa76d0055f5f0460205ebb3d7424a6f3553003
IEDL.DBID K7-
ISICitedReferencesCount 21
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000571619500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Sat Aug 23 13:15:54 EDT 2025
Tue Nov 18 21:17:33 EST 2025
Sat Nov 29 04:58:37 EST 2025
Wed Mar 13 05:46:36 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c360t-e5485f38d17d0360516a8dd4209aa76d0055f5f0460205ebb3d7424a6f3553003
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3917-8717
0000-0001-5902-4152
0000-0002-7456-041X
0000-0001-6051-7907
OpenAccessLink https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F8EDF1CABBEC7B5AC369B51D8BF90F7D/S1471068420000344a.pdf/div-class-title-verifying-tight-logic-programs-with-anthem-and-vampire-div.pdf
PQID 2444254002
PQPubID 43613
PageCount 16
ParticipantIDs proquest_journals_2444254002
crossref_citationtrail_10_1017_S1471068420000344
crossref_primary_10_1017_S1471068420000344
cambridge_journals_10_1017_S1471068420000344
PublicationCentury 2000
PublicationDate 20200900
2020-09-00
20200901
PublicationDateYYYYMMDD 2020-09-01
PublicationDate_xml – month: 09
  year: 2020
  text: 20200900
PublicationDecade 2020
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2020
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References Oikarinen (S1471068420000344_ref19) 2009; 4
S1471068420000344_ref2
S1471068420000344_ref4
Gebser (S1471068420000344_ref9) 2015; 4
S1471068420000344_ref3
S1471068420000344_ref6
Ferraris (S1471068420000344_ref7) 2011; 1
S1471068420000344_ref8
S1471068420000344_ref13
Gelfond (S1471068420000344_ref11) 1996; 1
S1471068420000344_ref14
S1471068420000344_ref15
Fages (S1471068420000344_ref5) 1994
S1471068420000344_ref16
S1471068420000344_ref17
S1471068420000344_ref18
Sutcliffe (S1471068420000344_ref20) 2017; 4
Harrison (S1471068420000344_ref12) 2017
Brewka (S1471068420000344_ref1) 2011; 12
S1471068420000344_ref10
S1471068420000344_ref21
References_xml – ident: S1471068420000344_ref21
– ident: S1471068420000344_ref18
– ident: S1471068420000344_ref17
– volume: 1
  start-page: 89
  year: 1996
  ident: S1471068420000344_ref11
  article-title: Towards a theory of elaboration tolerance: Logic programming approach
  publication-title: International Journal of Software Engineering and Knowledge Engineering 6
  doi: 10.1142/S0218194096000053
– ident: S1471068420000344_ref6
– ident: S1471068420000344_ref13
  doi: 10.1017/S1471068417000394
– ident: S1471068420000344_ref4
  doi: 10.1017/S1471068403001765
– ident: S1471068420000344_ref8
– ident: S1471068420000344_ref3
– start-page: 51
  year: 1994
  ident: S1471068420000344_ref5
  article-title: Consistency of Clark’s completion and the existence of stable models
  publication-title: Journal of Methods of Logic in Computer Science 1
– volume: 12
  start-page: 92
  year: 2011
  ident: S1471068420000344_ref1
  article-title: Answer set programming at a glance
  publication-title: Communications of the ACM 54
  doi: 10.1145/2043174.2043195
– volume: 4
  start-page: 483
  year: 2017
  ident: S1471068420000344_ref20
  article-title: The TPTP problem library and associated infrastructure
  publication-title: Journal of Automated Reasoning 59
  doi: 10.1007/s10817-017-9407-7
– ident: S1471068420000344_ref10
– start-page: 22
  year: 2017
  ident: S1471068420000344_ref12
  article-title: Infinitary equilibrium logic and strongly equivalent logic programs
  publication-title: Artificial Intelligence 246
  doi: 10.1016/j.artint.2017.02.002
– ident: S1471068420000344_ref15
– ident: S1471068420000344_ref14
– ident: S1471068420000344_ref16
– volume: 4
  start-page: 449
  year: 2015
  ident: S1471068420000344_ref9
  article-title: Abstract Gringo
  publication-title: Theory and Practice of Logic Programming 15
  doi: 10.1017/S1471068415000150
– ident: S1471068420000344_ref2
  doi: 10.1017/S1471068420000265
– volume: 4
  start-page: 591
  year: 2009
  ident: S1471068420000344_ref19
  article-title: A translation-based approach to the verification of modular equivalence
  publication-title: Journal of Logic and Computation 19
  doi: 10.1093/logcom/exn039
– volume: 1
  start-page: 236
  year: 2011
  ident: S1471068420000344_ref7
  article-title: Stable models and circumscription
  publication-title: Artificial Intelligence 175
  doi: 10.1016/j.artint.2010.04.011
SSID ssj0016324
Score 2.398864
Snippet This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 735
SubjectTerms Logic programs
Original Article
Semantics
Software
Software development tools
Title Verifying Tight Logic Programs with anthem and vampire
URI https://www.cambridge.org/core/product/identifier/S1471068420000344/type/journal_article
https://www.proquest.com/docview/2444254002
Volume 20
WOSCitedRecordID wos000571619500011&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
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA7aevBifWK1lhw8icHsZp8nUWkRhLJIleJlSTdZFOzDbu3vdyabbS1CL16ykE0gZCYzmUfmI-QSNA5cLPKccVgm80x8V4uQ-dBwT8aR8KQBmwh7vWgwiBPrcCtsWmUlE42gVpMMfeQ3oIaAvYDj3NvpF0PUKIyuWgiNbVJ3XNdBPn8K2TKKgKXIzeuiELN7Iq-KamLJaOzEPnyqgmXvftdWWNdR6yLa6J1u478r3id79sZJ70oWOSBbenxIGhWaA7WH-4gEr8CM5tUT7aPFThGGOaNJmcBVUPTYUqDDux7BR9GFHE1BXh6Tl26n__DILKoCy0TA50yDjeLnIlJOqEB9waEMZKQUbEQsZRgorMqV-zkGTF3u6-FQKDCfPRnkAiGGuDghtfFkrE8JjbUzhBuiKwQM51LEXEjQdU6mPR3Esdsk18s9Te3ZKNIyryxM_5CgSXi17WlmK5QjUMbnpilXyynTsjzHpsGtilCr1ayodLb59znZddHWNvllLVKbz771BdnJFvOPYtYm9ftOL3luGwaENvHffgAul9kP
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4gmuhFfEYUdQ96MTYu3T4PxhiVSEDCAQ23urTbaCIPKWL8U_5GZ_oAiQk3Dl7apN1tNp1vZ2bnCXCCEgcVizDUOC5TM2L_rhK2ZuKFG9J1hCHjZhN2o-G0224zB99ZLgyFVWY8MWbUQd8nG_kFiiGEFyJOvxq8a9Q1iryrWQuNBBY19fWJR7bosnqL9D3V9cpd6-ZeS7sKaL6w-EhTqKOboXCCsh0g-0ZQWtIJAkPnrpS2FVBVqtAMyWGoc1N1OiLA46MhrVBQix0u8LtLsGwIx6Za_TVbm3gtqPR5nM1kUzSRY2ReVCpRTQ_pGaXGUJm937UcZmXirEiI5Vyl8N_-0Aaspxo1u062wCbkVG8LClm3CpYyr22wnnCzxVldrEUWCUZtpn3WTALUIkYWaYY4e1FdvAVsLLsDlAc78LiQ1e9CvtfvqT1grip3UAPWhcDhXAqXC4myvOwrQ1muqxfhfEJDL937kZfEzdneH5IXgWdk9vy0Ajs1AnmbN-VsMmWQlB-ZN7iUAWO6mikq9ue_PobV-9ZD3atXG7UDWNPJrhDH0pUgPxp-qENY8cej12h4FIOewfOiMfQDds0vgA
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%3Ajournal&rft.genre=article&rft.atitle=Verifying+Tight+Logic+Programs+with+anthem+and+vampire&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FANDINNO%2C+JORGE&rft.au=LIFSCHITZ%2C+VLADIMIR&rft.au=L%C3%9CHNE%2C+PATRICK&rft.au=SCHAUB%2C+TORSTEN&rft.date=2020-09-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=20&rft.issue=5&rft.spage=735&rft.epage=750&rft_id=info:doi/10.1017%2FS1471068420000344&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068420000344
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon