A translational approach to constraint answer set solving

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory and practice of logic programming Ročník 10; číslo 4-6; s. 465 - 480
Hlavní autori: DRESCHER, CHRISTIAN, WALSH, TOBY
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cambridge, UK Cambridge University Press 01.07.2010
Predmet:
ISSN:1471-0684, 1475-3081
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.
AbstractList Abstract We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact. [PUBLICATION ABSTRACT]
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.
Author WALSH, TOBY
DRESCHER, CHRISTIAN
Author_xml – sequence: 1
  givenname: CHRISTIAN
  surname: DRESCHER
  fullname: DRESCHER, CHRISTIAN
  organization: Vienna University of Technology, Austria
– sequence: 2
  givenname: TOBY
  surname: WALSH
  fullname: WALSH, TOBY
  organization: NICTA and University of New South Wales, Australia
BookMark eNp9kF9LwzAUxYNMcJt-AN-C79V7m7RNHsfwHwx8UJ9Lmqazo0tmkil-e7NNEBS9L7nknF84ORMyss4aQs4RLhGwunpEXiGUgiOkyXM4IuN0VWQMBI72O2Y7_YRMQlgBYMlyPiZyRqNXNgwq9s6qgarNxjulX2h0VDsbktrbSJPl3XgaTKTBDW-9XZ6S404NwZx9nVPyfHP9NL_LFg-39_PZItNM5DFDJkxnQDMFvGUt67ACybiU0LQGG9k0TIhSqaqVvG26rjQojBbAjSygaCs2JReHd1Ou160JsV65rU9RQy2wyGVVckgmPJi0dyF409Ub36-V_6gR6l1B9a-CElP9YHQf9zXs_jz8S7IvUq0b37dL853pb-oTKaR52w
CitedBy_id crossref_primary_10_1016_j_artint_2024_104276
crossref_primary_10_1017_S147106841300032X
crossref_primary_10_1007_s10472_011_9237_y
crossref_primary_10_1016_j_artint_2013_10_004
crossref_primary_10_1017_S1471068417000242
crossref_primary_10_1017_S1471068417000138
crossref_primary_10_1017_S1471068417000424
crossref_primary_10_1609_aimag_v37i3_2673
crossref_primary_10_1017_S1471068417000102
crossref_primary_10_3390_a16040185
crossref_primary_10_1017_S1471068421000478
Cites_doi 10.1017/S1471068403001790
10.1023/A:1018930122475
10.1093/bioinformatics/bth918
10.1007/s10472-009-9116-y
10.1017/CBO9780511543357
10.1145/1217856.1217859
10.1016/0743-1066(94)90033-7
10.1016/S0004-3702(02)00187-X
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2010
Copyright_xml – notice: Copyright © Cambridge University Press 2010
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/S1471068410000220
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 Korea
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 (New)
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 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 480
ExternalDocumentID 2202539101
10_1017_S1471068410000220
Genre Feature
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-c382t-138efe0c3a04d3d3f170934990bde1b9bb3886aa7d94dbff6e18ec804e9505d73
IEDL.DBID P5Z
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000280508200008&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 Sun Nov 23 12:11:02 EST 2025
Sat Nov 29 04:58:34 EST 2025
Tue Nov 18 22:18:52 EST 2025
Wed Mar 13 05:36:34 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 4-6
Keywords constraint processing
decomposition
answer set programming
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c382t-138efe0c3a04d3d3f170934990bde1b9bb3886aa7d94dbff6e18ec804e9505d73
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 815297640
PQPubID 43613
PageCount 16
ParticipantIDs proquest_journals_815297640
crossref_primary_10_1017_S1471068410000220
crossref_citationtrail_10_1017_S1471068410000220
cambridge_journals_10_1017_S1471068410000220
PublicationCentury 2000
PublicationDate 20100700
2010-07-00
20100701
PublicationDateYYYYMMDD 2010-07-01
PublicationDate_xml – month: 07
  year: 2010
  text: 20100700
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 2010
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References Dovier (S1471068410000220_ref10) 2005
Biere (S1471068410000220_ref6) 2009
Walsh (S1471068410000220_ref36) 2000
S1471068410000220_ref27
S1471068410000220_ref2
Gent (S1471068410000220_ref18) 1999
S1471068410000220_ref3
Nogueira (S1471068410000220_ref31) 2001
Dechter (S1471068410000220_ref9) 2003
S1471068410000220_ref29
Leconte (S1471068410000220_ref23) 1996
Dal Palù (S1471068410000220_ref8) 2009
Baselice (S1471068410000220_ref4) 2005
Gebser (S1471068410000220_ref15) 2009
Lifschitz (S1471068410000220_ref25) 1999
S1471068410000220_ref20
Rossi (S1471068410000220_ref33) 2006
Järvisalo (S1471068410000220_ref22) 2009
S1471068410000220_ref21
Balduccini (S1471068410000220_ref1) 2009
Mitchell (S1471068410000220_ref28) 2005; 85
Tamura (S1471068410000220_ref35) 2006
You (S1471068410000220_ref37) 2004
Gebser (S1471068410000220_ref13) 2007
Gelfond (S1471068410000220_ref16) 1988
Gebser (S1471068410000220_ref14) 2007
S1471068410000220_ref30
Lee (S1471068410000220_ref24) 2005
Mellarkod (S1471068410000220_ref26) 2008
S1471068410000220_ref12
Gomes (S1471068410000220_ref19) 1997
S1471068410000220_ref34
Crawford (S1471068410000220_ref7) 1994
Gent (S1471068410000220_ref17) 2002
Fujita (S1471068410000220_ref11) 1993
Petrie (S1471068410000220_ref32) 2003
Bessière (S1471068410000220_ref5) 2009
References_xml – ident: S1471068410000220_ref20
  doi: 10.1017/S1471068403001790
– ident: S1471068410000220_ref29
  doi: 10.1023/A:1018930122475
– volume-title: Constraint Processing
  year: 2003
  ident: S1471068410000220_ref9
– start-page: 52
  volume-title: Proceedings of ICLP'05
  year: 2005
  ident: S1471068410000220_ref4
– start-page: 169
  volume-title: Proceedings of PADL'01
  year: 2001
  ident: S1471068410000220_ref31
– start-page: 235
  volume-title: Proceedings of ICLP'09
  year: 2009
  ident: S1471068410000220_ref15
– volume-title: Proceedings of IJCAI'09
  year: 2009
  ident: S1471068410000220_ref5
– start-page: 23
  volume-title: Proceedings of ICLP'99
  year: 1999
  ident: S1471068410000220_ref25
– start-page: 115
  volume-title: Proceedings of ICLP'09
  year: 2009
  ident: S1471068410000220_ref8
– volume-title: Handbook of Constraint Programming
  year: 2006
  ident: S1471068410000220_ref33
– volume: 85
  start-page: 112
  year: 2005
  ident: S1471068410000220_ref28
  article-title: A SAT solver primer
  publication-title: Bulletin of the European Association for Theoretical Computer Science
– start-page: 1070
  volume-title: Proceedings of ICLP'88
  year: 1988
  ident: S1471068410000220_ref16
– start-page: 52
  volume-title: Proceedings of IJCAI'93
  year: 1993
  ident: S1471068410000220_ref11
– start-page: 260
  volume-title: Proceedings of LPNMR'07
  year: 2007
  ident: S1471068410000220_ref13
– start-page: 314
  volume-title: Proceedings of ICLP'04
  year: 2004
  ident: S1471068410000220_ref37
– start-page: 121
  volume-title: Proceedings of ECAI'02
  year: 2002
  ident: S1471068410000220_ref17
– ident: S1471068410000220_ref3
  doi: 10.1093/bioinformatics/bth918
– start-page: 221
  volume-title: Proceedings of AAAI'97
  year: 1997
  ident: S1471068410000220_ref19
– ident: S1471068410000220_ref27
  doi: 10.1007/s10472-009-9116-y
– ident: S1471068410000220_ref2
  doi: 10.1017/CBO9780511543357
– ident: S1471068410000220_ref30
  doi: 10.1145/1217856.1217859
– start-page: 402
  volume-title: Proceedings of LPNMR'09
  year: 2009
  ident: S1471068410000220_ref1
– start-page: 386
  volume-title: Proceedings of IJCAI'07
  year: 2007
  ident: S1471068410000220_ref14
– volume-title: CP'96, Second International Workshop on Constraint-based Reasoning
  year: 1996
  ident: S1471068410000220_ref23
– start-page: 155
  volume-title: Proceedings of LPNMR'09
  year: 2009
  ident: S1471068410000220_ref22
– volume-title: Handbook of Satisfiability
  year: 2009
  ident: S1471068410000220_ref6
– start-page: 503
  volume-title: Proceedings of IJCAI'05
  year: 2005
  ident: S1471068410000220_ref24
– start-page: 930
  volume-title: Proceedings of CP'03
  year: 2003
  ident: S1471068410000220_ref32
– start-page: 441
  volume-title: Proceedings of CP'00
  year: 2000
  ident: S1471068410000220_ref36
– start-page: 590
  volume-title: Proceedings of CP'06
  year: 2006
  ident: S1471068410000220_ref35
– ident: S1471068410000220_ref21
  doi: 10.1016/0743-1066(94)90033-7
– start-page: 480
  volume-title: Proceedings of CP'99
  year: 1999
  ident: S1471068410000220_ref18
– start-page: 67
  volume-title: Proceedings of ICLP'05
  year: 2005
  ident: S1471068410000220_ref10
– start-page: 15
  volume-title: Proceedings of FLOPS'08
  year: 2008
  ident: S1471068410000220_ref26
– ident: S1471068410000220_ref12
– ident: S1471068410000220_ref34
  doi: 10.1016/S0004-3702(02)00187-X
– start-page: 1092
  volume-title: Proceedings of AAAI'94
  year: 1994
  ident: S1471068410000220_ref7
SSID ssj0016324
Score 2.0198512
Snippet We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint...
Abstract We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 465
SubjectTerms Regular Papers
Title A translational approach to constraint answer set solving
URI https://www.cambridge.org/core/product/identifier/S1471068410000220/type/journal_article
https://www.proquest.com/docview/815297640
Volume 10
WOSCitedRecordID wos000280508200008&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: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241211
  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 advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241211
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241211
  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/eLvHCXMwpV1LSwMxEB5s68GL9Ym1WnLwJC5mN-lucpIqLYJQiigUL2XzWBCkre2qf9_MbralCL14zSaQzUwyk5nJ9wFcKRtJo40MojCmAeeKB0KkJsicsiAzThTqrCCbSIZDMR7Lka_NWfqyyupMLA5qM9MYI78VztA408np3fwzQNIoTK56Bo0aNBAkAZkbRt23VRIBkciLx0UJFvcIXiU1ETEaG7GtCG9HyPa9hlbYNFGbJ3RhdgbNf074APa9v0l6pYIcwo6dHkGz4nIgfmsfg-yRHM3Whw8OkgpsnOQzotGJRC6JnLguP27c0ubEaS1GI07gddB_eXgMPK1CoJmIkHxe2MxSzVLKDTMsCxMqmbv5UGVsqKRSTIg4TRMjuVFZFttQWC0ot9K5SyZhp1Cfzqb2DEikNe26K24YZxHPmFaR0bHWkluVMhumLbhZrerEb47lpCwsSyZ_hNACWi38RHuIcvy7j21DrldD5iU-x7bO7UpU69ms5HS-9Wsb9srCAazUvYB6vviyl7Crv_P35aIDjfv-cPTcgdpTEnQKNfwFp8nduw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8MwDLbGQIILbwSMRw5wQVS0SWjTA0IImIYGEweQuJXmUQlp2sZaQPwo_iNxH5smpN124JrGVVPbsWM7_gCOpKGhVjp0qOe7DueSO0LE2kmssCAyDvVUkoNNBJ2OeHkJH2vwU92FwbLKak_MN2rdVxgjPxPW0FjTyd3LwbuDoFGYXK0QNAqpaJvvL3tiSy_ubix7jylt3j5dt5wSVMBRTFCEXhcmMa5iscs10yzxAnuot36_K7XxZCglE8KP40CHXMsk8Y0njBIuN6F1FnTA7HvnYJ4zEaBatQNnlLTAzuf5ZaYAi4kEr5Ko2KEaB3EsD6dTRBcft3KYNImTFiE3c82Vf_aDVmG59KfJVaEAa1AzvXVYqbAqSLl1bUB4RTI0y90y-EmqZuok6xOFTjJiZWTETvmydKnJiNVKjLZswvNMFrAF9V6_Z7aBUKXcc3uE9_yE8oQpSbXylQq5kTEzXrwDpyMuRqXyp1FROBdEf5i-A27F6EiVLdhxdd1pJCcjkkHRf2Ta5EYlGuOvGcnF7tSnh7DYenq4j-7vOu0GLBVFEliVvAf1bPhh9mFBfWZv6fAgF3oCr7MWol9uyDjt
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=A+translational+approach+to+constraint+answer+set+solving&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=DRESCHER%2C+CHRISTIAN&rft.au=WALSH%2C+TOBY&rft.date=2010-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=10&rft.issue=4-6&rft.spage=465&rft.epage=480&rft_id=info:doi/10.1017%2FS1471068410000220&rft.externalDocID=10_1017_S1471068410000220
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