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á bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 9; číslo POPL; s. 362 - 390
Hlavní autori:	Martens, Chris, Simmons, Robert J., Arntzenius, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 07.01.2025
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!