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žené v:
Podrobná bibliografia
Vydané v:Proceedings - International Conference on Tools with Artificial Intelligence, TAI s. 379 - 386
Hlavní autori: Garreau, Bryan, Lodeiro, Martin Dieguez, Monfroy, Eric, Stephan, Igor
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 28.10.2024
Predmet:
Answer set programming
Artificial intelligence
component
Constraint handling
formatting
insert
Iterative methods
Logic
Semantics
style
styling
ISSN:2375-0197
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:2375-0197
DOI:10.1109/ICTAI62512.2024.00062