Finite-Choice Logic Programming

Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeration of models that vary along some set of choices while maintaining structural and logical constraints...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 9; H. POPL; S. 362 - 390
Hauptverfasser:	Martens, Chris, Simmons, Robert J., Arntzenius, Michael
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 07.01.2025
Schlagworte:	Computing methodologies Constraint and logic languages Constraint and logic programming Control structures Database query languages (principles) Denotational semantics Logic and databases Logic programming and answer set programming Nonmonotonic, default reasoning and belief revision Software and its engineering Theory of computation Datalog possibility spaces answer set programming
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!