Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
Electronic Proceedings in Theoretical Computer Science · 20.07.2026 · 450 · 360-373
DOI: 10.4204/eptcs.450.27 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 20.07.2026. Verfasst von Pedro Cabalar und 5 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Cabalar, P., Fandinno, J., Rühling, N., Schaub, T., Schellhorn, S., & Wanko, P. (2026). Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report. Electronic Proceedings in Theoretical Computer Science, 450, 360-373. https://doi.org/10.4204/eptcs.450.27
Vancouver
Cabalar P, Fandinno J, Rühling N, Schaub T, Schellhorn S, Wanko P. Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report. Electronic Proceedings in Theoretical Computer Science. 2026;450:360-373. doi:10.4204/eptcs.450.27
BibTeX
@article{Cabalar2026,
author = {Cabalar, Pedro and Fandinno, Jorge and Rühling, Nicolas and Schaub, Torsten and Schellhorn, Sebastian and Wanko, Philipp},
title = {Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {450},
pages = {360--373},
doi = {10.4204/eptcs.450.27}
}
EUVIMED