Introducing Constraint Well-Founded Semantics for Constraint Logic Programming Through Rewriting Transformations

Constraint Answer Set Programming (CASP) combines Answer Set Programming (ASP) and Constraint Programming (CP) to offer a powerful framework for solving complex problems. While there exists various ways to represent CASP problems, fusing both in a way that benefits both communities remains difficult...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - International Conference on Tools with Artificial Intelligence, TAI s. 379 - 386
Hlavní autoři: Garreau, Bryan, Lodeiro, Martin Dieguez, Monfroy, Eric, Stephan, Igor
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 28.10.2024
Témata:
Answer set programming
Artificial intelligence
component
Constraint handling
formatting
insert
Iterative methods
Logic
Semantics
style
styling
ISSN:2375-0197
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 Constraint Answer Set Programming (CASP) combines Answer Set Programming (ASP) and Constraint Programming (CP) to offer a powerful framework for solving complex problems. While there exists various ways to represent CASP problems, fusing both in a way that benefits both communities remains difficult to this day. To address this, we propose to extend the Well Founded Semantics (WFS) to propositional constraint logic programs. To this end, we present an iterative process involving elementary rewriting transformations to simplify the program iteratively. Our method aims to give a better description of the interactions between ASP and CP inside of a constraint logic program.
AbstractList Constraint Answer Set Programming (CASP) combines Answer Set Programming (ASP) and Constraint Programming (CP) to offer a powerful framework for solving complex problems. While there exists various ways to represent CASP problems, fusing both in a way that benefits both communities remains difficult to this day. To address this, we propose to extend the Well Founded Semantics (WFS) to propositional constraint logic programs. To this end, we present an iterative process involving elementary rewriting transformations to simplify the program iteratively. Our method aims to give a better description of the interactions between ASP and CP inside of a constraint logic program.
Author Garreau, Bryan
Lodeiro, Martin Dieguez
Monfroy, Eric
Stephan, Igor
Author_xml – sequence: 1
  givenname: Bryan
  surname: Garreau
  fullname: Garreau, Bryan
  email: bryan.garreau@univ-angers.fr
  organization: Université d'Angers,Angers,France
– sequence: 2
  givenname: Martin Dieguez
  surname: Lodeiro
  fullname: Lodeiro, Martin Dieguez
  email: martin.dieguezlodeiro@univ-angers.fr
  organization: Université d'Angers,Angers,France
– sequence: 3
  givenname: Eric
  surname: Monfroy
  fullname: Monfroy, Eric
  email: eric.monfroy@univ-angers.fr
  organization: Université d'Angers,Angers,France
– sequence: 4
  givenname: Igor
  surname: Stephan
  fullname: Stephan, Igor
  email: igor.stephan@univ-angers.fr
  organization: Université d'Angers,Angers,France
BookMark eNpNjF1LwzAYRqMouM39A4X-gc43b5KmuRzFj8JA0YmXI23SLrImI80Q_73z48KrBw7POVNy5oO3hFxTWFAK6qau1su6QEFxgYB8AQAFnpC5kqpkjAqUyMQpmSCTIgeq5AWZjuM7AIJANiH72qcYzKF1vs-q4McUtfMpe7O7XX4XDt5Yk73YQfvk2jHrQvz_WoXetdlTDH3Uw_CdWG9jOPTb7Nl-RJd-SNR-PHqDTu5oXpLzTu9GO__bGXm9u11XD_nq8b6ulqvcUShSziU2hlttGtEYbLAz2Bra8o53VpWtgsKYVoLCTthCUyatFkJJ1ggrRCmAzcjVb9dZazf76AYdPzcUSq64oOwLivxf-A
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICTAI62512.2024.00062
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 9798331527235
EISSN 2375-0197
EndPage 386
ExternalDocumentID 10849451
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i106t-472bd4eadb5bd2b2fd2cd1c4f4fe98c906ddc7092f5e6a137ea55973b5e558503
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001447778900053&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Feb 12 06:22:42 EST 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i106t-472bd4eadb5bd2b2fd2cd1c4f4fe98c906ddc7092f5e6a137ea55973b5e558503
PageCount 8
ParticipantIDs ieee_primary_10849451
PublicationCentury 2000
PublicationDate 2024-Oct.-28
PublicationDateYYYYMMDD 2024-10-28
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-Oct.-28
  day: 28
PublicationDecade 2020
PublicationTitle Proceedings - International Conference on Tools with Artificial Intelligence, TAI
PublicationTitleAbbrev ICTAI
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020523
Score 1.88744
Snippet Constraint Answer Set Programming (CASP) combines Answer Set Programming (ASP) and Constraint Programming (CP) to offer a powerful framework for solving...
SourceID ieee
SourceType Publisher
StartPage 379
SubjectTerms Answer set programming
Artificial intelligence
component
Constraint handling
formatting
insert
Iterative methods
Logic
Semantics
style
styling
Title Introducing Constraint Well-Founded Semantics for Constraint Logic Programming Through Rewriting Transformations
URI https://ieeexplore.ieee.org/document/10849451
WOSCitedRecordID wos001447778900053&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/eLvHCXMwlV07T8MwELagYmAqjyLe8sAaSNI4TkZUUVEJVRUU6FY5vrNUqS-1Kfx97ty0dGFgiywnlnx27j77vvuEuIvAqgIULd6cKTk6NkHmjAl0AvRnUBSR-2yLjxfd7WaDQd6ryOqeC4OIPvkM7_nR3-XDzK74qIx2eJbkCROm97XWa7LWFl3x-WZF0YnC_KHT6j92UvbeBAJjLpEdsiLOjoSK9yDt-j_HPhKNXy6e7G29zLHYw-mJqG_EGGS1N0_FvMM557Cy1EuyDKcXfyjlJ47HgRdPQpBvOKGZHNmlpFh1txdLLlseh5O1JvyJ_lrAR77iN9c94padGJfebIj39lO_9RxUcgrBiHBfyYYoIKGVU5B14iJ2EFuIbOISh3lm8zAFsDrMY6cwNVFTo2G40SwUKgIVYfNM1KazKZ4LSQ6tUMqlBgiOgFHGYZoWoC2YxGboLkSDZ3A4X1fMGG4m7_KP9itxyEZinxBn16JWLlZ4Iw7sVzlaLm69nX8A5pCt1A
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVQQYJTWYrY8YFrIHHtLEdUUTWiVBUE6K1y7LFUqZvaBH4fj5uWXjhwiywnljx2Zp49bx4hd4FWItfCLt4EKTkRk15spPQiru2fQdiI3GVbfHSjXi8eDJJ-RVZ3XBgAcMlncI-P7i5fz1SJR2V2h8c84UiY3hWcs2BF19rgKzzhrEg6gZ88pK3sMQ3Rf1sYyLBIto-aOFsiKs6HtOv_HP2QNH7ZeLS_8TNHZAemx6S-lmOg1e48IfMUs851qWwvikKcTv6hoJ8wHntOPgk0fYOJncuRWlIbrW73QtFlheNgutYEP5GtJHzoK3xj5SNs2Ypy7ZsN8t5-ylodrxJU8EYW-RVoilxzu3Zyax-WM6OZ0oHihhtIYpX4odYq8hNmBIQyaEYgEXA0cwHCwgq_eUpq09kUzgi1Li0XwoRSW0CipZAGwjDXkdKSqxjMOWngDA7nq5oZw_XkXfzRfkv2O9lLd9hNe8-X5AANhh6CxVekVixKuCZ76qsYLRc3zuY_GGaxGw
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+-+International+Conference+on+Tools+with+Artificial+Intelligence%2C+TAI&rft.atitle=Introducing+Constraint+Well-Founded+Semantics+for+Constraint+Logic+Programming+Through+Rewriting+Transformations&rft.au=Garreau%2C+Bryan&rft.au=Lodeiro%2C+Martin+Dieguez&rft.au=Monfroy%2C+Eric&rft.au=Stephan%2C+Igor&rft.date=2024-10-28&rft.pub=IEEE&rft.eissn=2375-0197&rft.spage=379&rft.epage=386&rft_id=info:doi/10.1109%2FICTAI62512.2024.00062&rft.externalDocID=10849451