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...

Celý popis

Podrobná bibliografie

Vydáno v:	Proceedings of ACM on programming languages Ročník 9; číslo POPL; s. 362 - 390
Hlavní autoři:	Martens, Chris, Simmons, Robert J., Arntzenius, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 07.01.2025
Témata:	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
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!