Refine
Has Fulltext
- no (11)
Year of publication
- 2018 (11) (remove)
Language
- English (11) (remove)
Is part of the Bibliography
- yes (11)
Keywords
- 3D Point Clouds (1)
- Address matching (1)
- Attributed graphs (1)
- BIM (1)
- Blockchain (1)
- Chronic heart failure (1)
- Deep learning (1)
- Graph queries (1)
- Haptics (1)
- Hospitalisation (1)
- IOPS (1)
- Indoor Models (1)
- LSTM (1)
- Learning (1)
- Machine (1)
- Model generation (1)
- Nested graph conditions (1)
- O (1)
- Remote patient management (1)
- Service-Oriented (1)
- Tableau method (1)
- Telemonitoring (1)
- accessibility (1)
- address normalization (1)
- address parsing (1)
- blind (1)
- business process management (1)
- conditional functional dependencies (1)
- deterministic random walk (1)
- duplicate detection (1)
- force-feedback (1)
- gaming (1)
- geocoding (1)
- geographic information systems (1)
- image captioning (1)
- multimodal representations (1)
- mutli-task learning (1)
- process scheduling (1)
- random I (1)
- random forest (1)
- record linkage (1)
- research challenges (1)
- rotor-router model (1)
- similarity measures (1)
- single vertex discrepancy (1)
- small files (1)
- visually impaired (1)
- weight (1)
Institute
- Hasso-Plattner-Institut für Digital Engineering gGmbH (11) (remove)
In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP system clingo.
Under consideration for publication in Theory and Practice of Logic Programming (TPLP)