Multi-shot ASP solving with clingo

We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing lo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming Jg. 19; H. 1; S. 27 - 82
Hauptverfasser: GEBSER, MARTIN, KAMINSKI, ROLAND, KAUFMANN, BENJAMIN, SCHAUB, TORSTEN
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cambridge, UK Cambridge University Press 01.01.2019
Schlagworte:
ISSN:1471-0684, 1475-3081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo accomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end, clingo offers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control, clingo also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
AbstractList We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo . Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo accomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end, clingo offers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control, clingo also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo , respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo accomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end, clingo offers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control, clingo also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
Author GEBSER, MARTIN
KAMINSKI, ROLAND
KAUFMANN, BENJAMIN
SCHAUB, TORSTEN
Author_xml – sequence: 1
  givenname: MARTIN
  surname: GEBSER
  fullname: GEBSER, MARTIN
  organization: University of Potsdam, Germany
– sequence: 2
  givenname: ROLAND
  surname: KAMINSKI
  fullname: KAMINSKI, ROLAND
  organization: University of Potsdam, Germany
– sequence: 3
  givenname: BENJAMIN
  surname: KAUFMANN
  fullname: KAUFMANN, BENJAMIN
  organization: University of Potsdam, Germany
– sequence: 4
  givenname: TORSTEN
  orcidid: 0000-0002-7456-041X
  surname: SCHAUB
  fullname: SCHAUB, TORSTEN
  organization: INRIA Rennes, France
BookMark eNp9kFFLwzAQx4NMcJt-AN-KPlfvmixNHsfQKUwUps8lTdMto2tmkil-ezs3EBS9lzvu_r-74z8gvda1hpBzhCsEzK_nyHIELhgK6GLEjki_a41SCgJ7XzWmu_kJGYSwAkBOM9YnFw_bJto0LF1MxvOnJLjmzbaL5N3GZaKbrnSn5LhWTTBnhzwkL7c3z5O7dPY4vZ-MZ6mmHGJagmE11kxlgsuaawZKa5OXldCi0hQrlCIzSinQFVXGjBSVVHI0UkhVGkOH5HK_d-Pd69aEWKzc1rfdySJDDlxmHFinyvcq7V0I3tSFtlFF69rolW0KhGJnSPHLkI7EH-TG27XyH_8y9MCodelttTDfT_1NfQKsiHHY
CitedBy_id crossref_primary_10_1017_S1471068421000351
crossref_primary_10_1016_j_artint_2022_103754
crossref_primary_10_1017_S1471068422000047
crossref_primary_10_1017_S1471068423000017
crossref_primary_10_4204_EPTCS_416_19
crossref_primary_10_1017_S1471068425100288
crossref_primary_10_1093_logcom_exad038
crossref_primary_10_1016_j_ijar_2023_109040
crossref_primary_10_1017_S1471068424000115
crossref_primary_10_1017_S147106842000037X
crossref_primary_10_1017_S147106842100034X
crossref_primary_10_1017_S1471068421000557
crossref_primary_10_1007_s10994_025_06780_7
crossref_primary_10_1109_ACCESS_2025_3569496
crossref_primary_10_1017_S1471068420000228
crossref_primary_10_1017_S1471068418000200
crossref_primary_10_1017_S1471068422000217
crossref_primary_10_1145_3659097
crossref_primary_10_1145_3583136
crossref_primary_10_1007_s10472_023_09886_7
crossref_primary_10_1017_S1471068425100276
crossref_primary_10_1017_S1471068423000169
crossref_primary_10_1016_j_artint_2024_104276
crossref_primary_10_1007_s10994_020_05934_z
crossref_primary_10_1017_S1471068421000508
crossref_primary_10_1017_S1471068424000103
crossref_primary_10_1007_s10514_022_10042_z
crossref_primary_10_4204_EPTCS_416_3
crossref_primary_10_1145_3704849
crossref_primary_10_1017_S1471068421000387
crossref_primary_10_3233_IA_240031
crossref_primary_10_4204_EPTCS_416_38
crossref_primary_10_3233_IA_240032
crossref_primary_10_1007_s10462_022_10389_w
crossref_primary_10_1007_s10586_025_05253_9
crossref_primary_10_1109_LRA_2023_3330611
crossref_primary_10_1145_3720420
crossref_primary_10_3390_a16030159
crossref_primary_10_1016_j_artint_2022_103810
crossref_primary_10_4204_EPTCS_416_32
crossref_primary_10_1017_S1471068420000046
crossref_primary_10_1109_ACCESS_2023_3305272
crossref_primary_10_1186_s13015_019_0145_8
crossref_primary_10_1017_S1471068425100148
crossref_primary_10_1016_j_artint_2021_103651
crossref_primary_10_1093_logcom_exae038
crossref_primary_10_1017_S1471068425100264
crossref_primary_10_1016_j_artint_2024_104230
crossref_primary_10_1017_S1471068418000297
crossref_primary_10_1016_j_artint_2023_104023
crossref_primary_10_1017_S1471068424000255
crossref_primary_10_1093_logcom_exad017
crossref_primary_10_1016_j_eswa_2022_117599
crossref_primary_10_1017_S1471068425000067
crossref_primary_10_1007_s10994_024_06610_2
crossref_primary_10_1109_TKDE_2022_3232207
crossref_primary_10_1080_13875868_2024_2324875
crossref_primary_10_1109_TVCG_2021_3114804
crossref_primary_10_1017_S1471068420000289
crossref_primary_10_1007_s10696_019_09354_7
crossref_primary_10_3390_a16030169
crossref_primary_10_1017_S1471068419000176
crossref_primary_10_1017_S1471068423000066
crossref_primary_10_1017_S147106842300025X
crossref_primary_10_1016_j_ijar_2023_108992
crossref_primary_10_1017_S147106842100051X
crossref_primary_10_4204_EPTCS_416_40
crossref_primary_10_1016_j_ins_2022_12_116
crossref_primary_10_1017_S1471068422000072
Cites_doi 10.1007/978-3-319-11558-0_39
10.1016/S0004-3702(02)00183-2
10.1017/S1471068412000233
10.1007/978-3-642-20895-9_7
10.1007/978-3-642-41524-1_16
10.1609/aimag.v37i3.2672
10.1007/978-3-642-20895-9_39
10.1007/978-3-319-14726-0_2
10.1007/978-3-642-20895-9
10.1145/1217856.1217859
10.1007/978-3-540-89982-2_23
10.1017/S1471068415000228
10.1007/978-3-540-78800-3_24
10.1017/S1471068415000150
10.1007/978-3-642-40564-8_31
10.1017/S147106841500023X
10.1007/978-3-642-02846-5_17
10.1017/S1471068417000242
10.3233/AIC-2011-0491
10.1007/978-3-319-61033-7_6
10.1007/978-3-540-24605-3_37
10.1007/978-3-319-23264-5_15
10.1017/S1471068412000142
10.1017/CBO9780511543357
10.1007/978-3-319-23264-5
10.1007/s10472-007-9076-z
10.1016/S1571-0661(05)82542-3
10.1007/978-3-319-23264-5_7
10.1016/j.artint.2006.02.002
10.1007/978-3-642-40564-8_35
10.1017/S1471068417000138
10.1007/978-3-319-61660-5_30
10.1016/S0004-3702(02)00187-X
10.1007/978-3-642-40564-8
10.1145/1149114.1149117
10.1007/978-3-319-61660-5_26
10.1007/978-3-319-23264-5_5
10.1007/978-3-319-61660-5
10.2200/S00457ED1V01Y201211AIM019
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2018
Copyright_xml – notice: Copyright © Cambridge University Press 2018
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/S1471068418000054
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
ProQuest Central
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)
ProQuest 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 CrossRef
Computer Science Database

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate M. Gebser et al.
Multi-shot ASP solving with clingo
EISSN 1475-3081
EndPage 82
ExternalDocumentID 10_1017_S1471068418000054
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
Q9U
ID FETCH-LOGICAL-c360t-b0e4f1f4a2869f6c40acce7bd8c8dc31d1982eaaa0cd3aee5a393961e989abee3
IEDL.DBID K7-
ISICitedReferencesCount 193
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454429700002&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 Fri Jul 25 22:19:20 EDT 2025
Tue Nov 18 22:01:36 EST 2025
Sat Nov 29 04:58:36 EST 2025
Wed Mar 13 05:52:38 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c360t-b0e4f1f4a2869f6c40acce7bd8c8dc31d1982eaaa0cd3aee5a393961e989abee3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-7456-041X
OpenAccessLink https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FAED3429900D84CDD5155326A36548F2/S1471068418000054a.pdf/div-class-title-multi-shot-asp-solving-with-clingo-div.pdf
PQID 2160692604
PQPubID 43613
PageCount 56
ParticipantIDs proquest_journals_2160692604
crossref_citationtrail_10_1017_S1471068418000054
crossref_primary_10_1017_S1471068418000054
cambridge_journals_10_1017_S1471068418000054
PublicationCentury 2000
PublicationDate 20190100
2019-01-00
20190101
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 20190100
PublicationDecade 2010
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 2019
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068418000054_ref60
S1471068418000054_ref61
S1471068418000054_ref24
S1471068418000054_ref25
S1471068418000054_ref22
S1471068418000054_ref23
Gebser (S1471068418000054_ref39) 2011; 24
S1471068418000054_ref20
S1471068418000054_ref21
Gebser (S1471068418000054_ref38) 2015
S1471068418000054_ref28
S1471068418000054_ref29
S1471068418000054_ref26
S1471068418000054_ref27
S1471068418000054_ref50
S1471068418000054_ref13
S1471068418000054_ref57
Abiteboul (S1471068418000054_ref1) 1995
S1471068418000054_ref58
S1471068418000054_ref14
S1471068418000054_ref55
S1471068418000054_ref11
S1471068418000054_ref12
S1471068418000054_ref56
S1471068418000054_ref53
S1471068418000054_ref10
S1471068418000054_ref54
S1471068418000054_ref51
S1471068418000054_ref52
S1471068418000054_ref19
S1471068418000054_ref17
S1471068418000054_ref18
S1471068418000054_ref59
S1471068418000054_ref15
S1471068418000054_ref16
S1471068418000054_ref46
S1471068418000054_ref47
S1471068418000054_ref44
S1471068418000054_ref45
S1471068418000054_ref42
S1471068418000054_ref43
S1471068418000054_ref40
S1471068418000054_ref41
S1471068418000054_ref48
S1471068418000054_ref49
S1471068418000054_ref8
S1471068418000054_ref9
S1471068418000054_ref6
S1471068418000054_ref7
S1471068418000054_ref4
S1471068418000054_ref5
S1471068418000054_ref35
S1471068418000054_ref2
S1471068418000054_ref36
S1471068418000054_ref3
S1471068418000054_ref33
S1471068418000054_ref34
S1471068418000054_ref31
S1471068418000054_ref32
S1471068418000054_ref30
S1471068418000054_ref37
References_xml – ident: S1471068418000054_ref34
– ident: S1471068418000054_ref2
  doi: 10.1007/978-3-319-11558-0_39
– ident: S1471068418000054_ref3
  doi: 10.1016/S0004-3702(02)00183-2
– ident: S1471068418000054_ref30
  doi: 10.1017/S1471068412000233
– ident: S1471068418000054_ref35
  doi: 10.1007/978-3-642-20895-9_7
– ident: S1471068418000054_ref21
  doi: 10.1007/978-3-642-41524-1_16
– ident: S1471068418000054_ref52
  doi: 10.1609/aimag.v37i3.2672
– ident: S1471068418000054_ref19
– ident: S1471068418000054_ref44
  doi: 10.1007/978-3-642-20895-9_39
– ident: S1471068418000054_ref45
  doi: 10.1007/978-3-319-14726-0_2
– ident: S1471068418000054_ref48
– volume-title: Foundations of Databases
  year: 1995
  ident: S1471068418000054_ref1
– ident: S1471068418000054_ref22
  doi: 10.1007/978-3-642-20895-9
– ident: S1471068418000054_ref55
  doi: 10.1145/1217856.1217859
– ident: S1471068418000054_ref54
– ident: S1471068418000054_ref40
  doi: 10.1007/978-3-540-89982-2_23
– ident: S1471068418000054_ref5
  doi: 10.1017/S1471068415000228
– ident: S1471068418000054_ref33
– ident: S1471068418000054_ref27
– ident: S1471068418000054_ref23
– ident: S1471068418000054_ref20
  doi: 10.1007/978-3-540-78800-3_24
– ident: S1471068418000054_ref36
  doi: 10.1017/S1471068415000150
– ident: S1471068418000054_ref32
  doi: 10.1007/978-3-642-40564-8_31
– ident: S1471068418000054_ref7
– ident: S1471068418000054_ref43
– ident: S1471068418000054_ref60
– ident: S1471068418000054_ref6
  doi: 10.1017/S147106841500023X
– ident: S1471068418000054_ref24
  doi: 10.1007/978-3-642-02846-5_17
– ident: S1471068418000054_ref47
– ident: S1471068418000054_ref12
– ident: S1471068418000054_ref50
  doi: 10.1017/S1471068417000242
– volume: 24
  start-page: 107
  year: 2011
  ident: S1471068418000054_ref39
  article-title: Potassco: The Potsdam answer set solving collection
  publication-title: AI Communications
  doi: 10.3233/AIC-2011-0491
– ident: S1471068418000054_ref51
  doi: 10.1007/978-3-319-61033-7_6
– ident: S1471068418000054_ref49
– ident: S1471068418000054_ref29
  doi: 10.1007/978-3-540-24605-3_37
– ident: S1471068418000054_ref26
– ident: S1471068418000054_ref13
  doi: 10.1007/978-3-319-23264-5_15
– ident: S1471068418000054_ref57
  doi: 10.1017/S1471068412000142
– ident: S1471068418000054_ref11
  doi: 10.1017/CBO9780511543357
– ident: S1471068418000054_ref18
  doi: 10.1007/978-3-319-23264-5
– volume-title: Potassco User Guide
  year: 2015
  ident: S1471068418000054_ref38
– ident: S1471068418000054_ref17
– ident: S1471068418000054_ref16
  doi: 10.1007/s10472-007-9076-z
– ident: S1471068418000054_ref28
  doi: 10.1016/S1571-0661(05)82542-3
– ident: S1471068418000054_ref46
– ident: S1471068418000054_ref8
  doi: 10.1007/978-3-319-23264-5_7
– ident: S1471068418000054_ref61
  doi: 10.1016/j.artint.2006.02.002
– ident: S1471068418000054_ref37
  doi: 10.1007/978-3-642-40564-8_35
– ident: S1471068418000054_ref10
  doi: 10.1017/S1471068417000138
– ident: S1471068418000054_ref58
  doi: 10.1007/978-3-319-61660-5_30
– ident: S1471068418000054_ref56
– ident: S1471068418000054_ref31
– ident: S1471068418000054_ref59
  doi: 10.1016/S0004-3702(02)00187-X
– ident: S1471068418000054_ref15
  doi: 10.1007/978-3-642-40564-8
– ident: S1471068418000054_ref53
  doi: 10.1145/1149114.1149117
– ident: S1471068418000054_ref25
  doi: 10.1007/978-3-319-61660-5_26
– ident: S1471068418000054_ref41
– ident: S1471068418000054_ref4
  doi: 10.1007/978-3-319-23264-5_5
– ident: S1471068418000054_ref9
  doi: 10.1007/978-3-319-61660-5
– ident: S1471068418000054_ref14
– ident: S1471068418000054_ref42
  doi: 10.2200/S00457ED1V01Y201211AIM019
SSID ssj0016324
Score 2.6149502
Snippet We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 27
SubjectTerms Application programming interface
Logic programs
Mathematical programming
Original Article
Reasoning
Robotics
Semantics
Shot
Stability
Subroutines
Title Multi-shot ASP solving with clingo
URI https://www.cambridge.org/core/product/identifier/S1471068418000054/type/journal_article
https://www.proquest.com/docview/2160692604
Volume 19
WOSCitedRecordID wos000454429700002&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/eLvHCXMwpV3NS8MwFA-6efDi_MTpHEU8icGmSZvkJFMcgjCKHzC8lDRNVZB1rtW_3yRNN4ewi5ce0gTCy8t7L-_rB8BZivW7h3IFVZSFkJgyGW3XSxgxoWiYCpliacEm6GjExmMeO4db6dIqG5loBXVWSOMjvwyQNrW5tr7J1fQTGtQoE111EBrroI2CABk-v6dwHkUwrchtdRE12T2MNFFN0zLaDJoxxHxrt_zurbCso5ZFtNU7w85_d7wNtpzF6Q1qFtkBa2qyCzoNmoPnLvceOLW1uLB8Kypv8Bh7mimNs8EznlrPFFC-FvvgeXj7dHMHHYIClDjyK5j6iuQoJyJgEc8jSXwhpaJpxiTLJEYZ4ixQQghfZlgoFQrMMY-Q4oyLVCl8AFqTYqIOgZdLKvRjkSAuCaEpErbVXpARpoTRcV1wMadf4u5BmdQ5ZDT5Q-4u8BsSJ9J1IzegGB-rlpzPl0zrVhyrJveaQ1nsZnEiR6t_H4NNbRjx2tXSA61q9qVOwIb8rt7LWR-0r29H8UPfMpv-xuHLD93a1Sk
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFfRifWK1ahC9iIt5bJLdg0hRS0trKViheImbzUYFaWsTFf-Uv9HdPFqL0FsPXjfZsGRmdt7fABz7lvR7XCqQcAIbYdUmI-16jhzChGv7jPsWT4ZNuO026fVopwDfeS-MKqvM78Tkog4GXMXIz01DmtpUWt_4cviG1NQolV3NR2ikbNEUX5_SZYsuGteSviemWbvpXtVRNlUAccvRY-TrAodGiJlJHBo6HOuMc-H6AeEk4JYRSDfcFIwxnQcWE8JmFrWoYwhKKPOFsOR3F2ARY-ksSfnp2A_jrIWCPk-6mVxVTURwnkVVENVqUa0ZRE_spN9YDtM6cVolJHquVvpvf2gNVjOLWqumIrAOBdHfgFI-rULLLq9NOEp6jVH0PIi16l1Hk0KngimaikRrqkH0abAF93M56TYU-4O-2AEt5C6TzjA2KMfY9Q2WQAmaASaCKR1ehrMxvbxMziMvrZFzvT_kLYOek9TjGdq6GvrxOmvL6XjLMIUamfVyJWeCyWkmHLA7-_EhLNe7ty2v1Wg392BFGoE0DStVoBiP3sU-LPGP-CUaHSQMrsHjvPnlBwpHNBM
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=Multi-shot+ASP+solving+with+clingo&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=GEBSER%2C+MARTIN&rft.au=KAMINSKI%2C+ROLAND&rft.au=KAUFMANN%2C+BENJAMIN&rft.au=SCHAUB%2C+TORSTEN&rft.date=2019-01-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=19&rft.issue=1&rft.spage=27&rft.epage=82&rft_id=info:doi/10.1017%2FS1471068418000054&rft.externalDocID=10_1017_S1471068418000054
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