Inproceedings3395: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Lukas Gerlach (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Lukas |ErsterAutorNachname=Gerlach |FurtherAuthors=David Carral; Markus Hecher }} {{Inproceedings |Referiert=1 |Title=Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract) |To appear=1 |Year=2024 |Month=November |Booktitle=Proceedings of the 22nd International Workshop on Non-Monotonic Reasoning |Editor=Nina Gierasimczuk, Jesse Heyninck |Note=Extended Abstract of https://…“) |
Lukas Gerlach (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 7: | Zeile 7: | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract) | |Title=Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract) | ||
|To appear= | |To appear=0 | ||
|Year=2024 | |Year=2024 | ||
|Month=November | |Month=November | ||
|Booktitle=Proceedings of the 22nd International Workshop on | |Booktitle=Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024) | ||
|Pages=183-186 | |||
|Publisher=CEUR-WS.org | |||
|Editor=Nina Gierasimczuk, Jesse Heyninck | |Editor=Nina Gierasimczuk, Jesse Heyninck | ||
|Series=CEUR Workshop Proceedings | |||
|Volume=3835 | |||
|Note=Extended Abstract of https://doi.org/10.24963/ijcai.2024/375 | |Note=Extended Abstract of https://doi.org/10.24963/ijcai.2024/375 | ||
}} | }} | ||
| Zeile 17: | Zeile 21: | ||
|Abstract=Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function symbols makes basic reasoning problems highly undecidable. However, even in simple cases, state of the art reasoners, specifically those relying on a ground-and-solve approach, fail to produce a result. Therefore, we reconsider consistency as a basic reasoning problem for ASP. We show reductions that give an intuition for the high level of undecidability. These insights allow for a more fine-grained analysis where we characterize ASP programs as “frugal” and “non-proliferous”. For such programs, we are not only able to semi-decide consistency but we also propose a grounding procedure that yields finite groundings on more ASP programs with the concept of “forbidden” facts. | |Abstract=Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function symbols makes basic reasoning problems highly undecidable. However, even in simple cases, state of the art reasoners, specifically those relying on a ground-and-solve approach, fail to produce a result. Therefore, we reconsider consistency as a basic reasoning problem for ASP. We show reductions that give an intuition for the high level of undecidability. These insights allow for a more fine-grained analysis where we characterize ASP programs as “frugal” and “non-proliferous”. For such programs, we are not only able to semi-decide consistency but we also propose a grounding procedure that yields finite groundings on more ASP programs with the concept of “forbidden” facts. | ||
|Download=NMR-2024-Submission-8-camera-ready.pdf | |Download=NMR-2024-Submission-8-camera-ready.pdf | ||
|Slides=NMR2024-Presentation-Gerlach.pdf | |||
|Link=https://ceur-ws.org/Vol-3835/short1.pdf | |||
|Projekt=Cfaed, CPEC, SECAI, ScaDS.AI | |Projekt=Cfaed, CPEC, SECAI, ScaDS.AI | ||
|Forschungsgruppe=Wissensbasierte Systeme | |Forschungsgruppe=Wissensbasierte Systeme | ||
}} | }} | ||
Version vom 21. Januar 2025, 11:11 Uhr
Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)
Lukas GerlachLukas Gerlach, David CarralDavid Carral, Markus HecherMarkus Hecher
Lukas Gerlach, David Carral, Markus Hecher
Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)
In Nina Gierasimczuk, Jesse Heyninck, eds., Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024), volume 3835 of CEUR Workshop Proceedings, 183-186, November 2024. CEUR-WS.org
Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)
In Nina Gierasimczuk, Jesse Heyninck, eds., Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024), volume 3835 of CEUR Workshop Proceedings, 183-186, November 2024. CEUR-WS.org
- KurzfassungAbstract
Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function symbols makes basic reasoning problems highly undecidable. However, even in simple cases, state of the art reasoners, specifically those relying on a ground-and-solve approach, fail to produce a result. Therefore, we reconsider consistency as a basic reasoning problem for ASP. We show reductions that give an intuition for the high level of undecidability. These insights allow for a more fine-grained analysis where we characterize ASP programs as “frugal” and “non-proliferous”. For such programs, we are not only able to semi-decide consistency but we also propose a grounding procedure that yields finite groundings on more ASP programs with the concept of “forbidden” facts. - Bemerkung: Note: Extended Abstract of https://doi.org/10.24963/ijcai.2024/375
- Weitere Informationen unter:Further Information: Link
- Projekt:Project: Cfaed, CPEC, SECAI, ScaDS.AI
- Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{GCH2024,
author = {Lukas Gerlach and David Carral and Markus Hecher},
title = {Finite Groundings for {ASP} with Functions: A Journey through
Consistency (Extended Abstract)},
editor = {Nina Gierasimczuk and Jesse Heyninck},
booktitle = {Proceedings of the 22nd International Workshop on Nonmonotonic
Reasoning (NMR 2024)},
series = {CEUR Workshop Proceedings},
volume = {3835},
publisher = {CEUR-WS.org},
year = {2024},
month = {November},
pages = {183-186}
}
