Towards Metric Temporal Answer Set Programming
| Autor: | Torsten Schaub, Anna Schuhmann, Pedro Cabalar, Martín Diéguez |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Theoretical computer science Computer science Computer Science - Artificial Intelligence Analogy 02 engineering and technology 01 natural sciences Theoretical Computer Science Answer set programming Artificial Intelligence Computer Science::Logic in Computer Science 0202 electrical engineering electronic engineering information engineering Time domain 0101 mathematics Institut für Informatik und Computational Science 010102 general mathematics Equilibrium logic Logic in Computer Science (cs.LO) Artificial Intelligence (cs.AI) Computational Theory and Mathematics Hardware and Architecture Bounded function ddc:000 Dynamic logic (modal logic) 020201 artificial intelligence & image processing Software |
| Popis: | 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. Paper presented at the 36th International Conference on Logic Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September 2020, 28 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|