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

Uložené v:
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!
Popis
Shrnutí: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—there is no single canonical model. The notion of stable models for logic programs with negation has successfully captured programmer intuition about the set of valid solutions for such problems, giving rise to a family of programming languages and associated solvers known as answer set programming. Unfortunately, the definition of a stable model is frustratingly indirect, especially in the presence of rules containing free variables. We propose a new formalism, finite-choice logic programming, that uses choice, not negation, to admit multiple solutions. Finite-choice logic programming contains all the expressive power of the stable model semantics, gives meaning to a new and useful class of programs, and enjoys a least-fixed-point interpretation over a novel domain. We present an algorithm for exploring the solution space and prove it correct with respect to our semantics. Our implementation, the Dusa logic programming language, has performance that compares favorably with state-of-the-art answer set solvers and exhibits more predictable scaling with problem size.
ISSN:2475-1421
2475-1421
DOI:10.1145/3704849