Institut für Informatik und Computational Science
Refine
Has Fulltext
- no (155) (remove)
Year of publication
Document Type
- Article (155) (remove)
Is part of the Bibliography
- yes (155)
Keywords
- answer set programming (6)
- Answer Set Programming (5)
- Answer set programming (5)
- Theory (2)
- bioinformatics (2)
- Aggregates (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
- Automated parallelization (1)
- Boolean logic models (1)
Institute
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.