প্রচ্ছদ

Past-present temporal programs over finite traces

সংরক্ষণ করুন:
প্রকাশিত:arXiv.org (Jan 20, 2024), p. n/a
প্রধান লেখক: Cabalar, Pedro
অন্যান্য লেখক: Diéguez, Martín, Laferrière, François, Schaub, Torsten
প্রকাশিত:
Cornell University Library, arXiv.org
বিষয়গুলি:
Logic programming
Declarative programming
Mathematical programming
অনলাইন ব্যবহার করুন:Citation/Abstract
Full text outside of ProQuest
ট্যাগগুলো: ট্যাগ যুক্ত করুন
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!

MARC

LEADER 00000nab a2200000uu 4500
001 2841704674
003 UK-CbPIL
022 |a 2331-8422 
035 |a 2841704674 
045 0 |b d20240120 
100 1 |a Cabalar, Pedro 
245 1 |a Past-present temporal programs over finite traces 
260 |b Cornell University Library, arXiv.org  |c Jan 20, 2024 
513 |a Working Paper 
520 3 |a Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logic programming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLf expression. 
653 |a Logic programming 
653 |a Declarative programming 
653 |a Mathematical programming 
700 1 |a Diéguez, Martín 
700 1 |a Laferrière, François 
700 1 |a Schaub, Torsten 
773 0 |t arXiv.org  |g (Jan 20, 2024), p. n/a 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2841704674/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://arxiv.org/abs/2307.12620