Temporal Answer Set Programming on Finite Traces
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)...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 18; číslo 3-4; s. 406 - 420 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.07.2018
|
| Témata: | |
| ISSN: | 1471-0684, 1475-3081 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | 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) |
|---|---|
| AbstractList | 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) 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) |
| Author | CABALAR, PEDRO SCHUHMANN, ANNA KAMINSKI, ROLAND SCHAUB, TORSTEN |
| Author_xml | – sequence: 1 givenname: PEDRO surname: CABALAR fullname: CABALAR, PEDRO organization: University of Corunna, Spain – sequence: 2 givenname: ROLAND surname: KAMINSKI fullname: KAMINSKI, ROLAND organization: University of Potsdam, Germany – sequence: 3 givenname: TORSTEN orcidid: 0000-0002-7456-041X surname: SCHAUB fullname: SCHAUB, TORSTEN organization: University of Potsdam, Germany – sequence: 4 givenname: ANNA surname: SCHUHMANN fullname: SCHUHMANN, ANNA organization: University of Potsdam, Germany |
| BookMark | eNp9kNFLwzAQxoNMcJv-Ab4VfK7eJU3SPo7hVBgorD6XNE1HxprMpEP87-3cQFD06Y6773ff8U3IyHlnCLlGuEVAebfCTCKIPMMcAGghz8h4GPGUQY6jrx7Tw_6CTGLcAKBgNBsTKE2380Ftk5mL7yYkK9MnL8Gvg-o669aJd8nCOtubpAxKm3hJzlu1jebqVKfkdXFfzh_T5fPD03y2THVGRZ_WvBCos0JmTAvKayMM40h5y7RWhjU5l6aoVVvwhtaagdCSMt7wphFaADZsSm6Od3fBv-1N7KuN3wc3WFYUckGBUywGlTyqdPAxBtNW2vaqt971QdlthVAd4ql-xTOQ-IPcBdup8PEvw06M6upgm7X5fupv6hNlO3Xs |
| CitedBy_id | crossref_primary_10_1016_j_artint_2020_103249 crossref_primary_10_1017_S147106842100051X crossref_primary_10_1145_3651161 crossref_primary_10_1080_13875868_2024_2324875 crossref_primary_10_1017_S1471068421000557 crossref_primary_10_1017_S1471068421000259 crossref_primary_10_1017_S1471068423000315 crossref_primary_10_1080_11663081_2023_2244365 crossref_primary_10_1017_S1471068420000307 |
| Cites_doi | 10.1109/LICS.2015.65 10.1007/978-3-642-20895-9_43 10.1007/3-540-46767-X_28 10.1007/978-3-642-30743-0_20 10.1080/11663081.2013.798985 10.1017/S1471068418000054 10.1007/978-3-642-32211-2_5 10.1017/S1471068415000307 10.1109/SFCS.1977.32 10.1007/978-3-642-15675-5_8 10.1007/3-540-51803-7_36 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2018 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2018 |
| DBID | AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U |
| DOI | 10.1017/S1471068418000297 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni Edition) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Pedro Cabalar et al. Temporal Answer Set Programming on Finite Traces |
| EISSN | 1475-3081 |
| EndPage | 420 |
| ExternalDocumentID | 10_1017_S1471068418000297 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 3V. 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ATUCA AUXHV AZQEC BBLKV BENPR BGHMG BGLVJ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CFAFE CHEAL CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V M0N NIKVX O9- OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WYP ZYDXJ AAYXX ABGDZ ABXHF AFFHD AKMAY CITATION IPYYG PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c426t-b5961c49743c625be6e35125f3ccae3d857e9baf95d2bc306c7235d5dd6c601d3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 25 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000441294400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-0684 |
| IngestDate | Sun Jul 13 04:25:29 EDT 2025 Tue Nov 18 22:33:04 EST 2025 Sat Nov 29 04:58:36 EST 2025 Tue Jan 21 06:19:07 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3-4 |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c426t-b5961c49743c625be6e35125f3ccae3d857e9baf95d2bc306c7235d5dd6c601d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-7456-041X |
| OpenAccessLink | https://easychair.org/publications/preprint_open/hqRj |
| PQID | 2086205219 |
| PQPubID | 43613 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_2086205219 crossref_citationtrail_10_1017_S1471068418000297 crossref_primary_10_1017_S1471068418000297 cambridge_journals_10_1017_S1471068418000297 |
| PublicationCentury | 2000 |
| PublicationDate | 20180700 2018-07-00 20180701 |
| PublicationDateYYYYMMDD | 2018-07-01 |
| PublicationDate_xml | – month: 07 year: 2018 text: 20180700 |
| PublicationDecade | 2010 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationTitleAlternate | Theory and Practice of Logic Programming |
| PublicationYear | 2018 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068418000297_ref5 S1471068418000297_ref6 Gelfond (S1471068418000297_ref13) 1998; 3 S1471068418000297_ref7 S1471068418000297_ref12 Sandewall (S1471068418000297_ref20) 1994 Emerson (S1471068418000297_ref8) 1990 S1471068418000297_ref10 S1471068418000297_ref11 S1471068418000297_ref1 S1471068418000297_ref2 S1471068418000297_ref3 S1471068418000297_ref4 Tseitin (S1471068418000297_ref21) 1968; 8 S1471068418000297_ref18 S1471068418000297_ref19 S1471068418000297_ref16 S1471068418000297_ref17 Fages (S1471068418000297_ref9) 1994; 1 S1471068418000297_ref15 Heyting (S1471068418000297_ref14) 1930 |
| References_xml | – ident: S1471068418000297_ref2 doi: 10.1109/LICS.2015.65 – ident: S1471068418000297_ref5 doi: 10.1007/978-3-642-20895-9_43 – ident: S1471068418000297_ref15 – ident: S1471068418000297_ref16 doi: 10.1007/3-540-46767-X_28 – start-page: 995 volume-title: Handbook of Theoretical Computer Science year: 1990 ident: S1471068418000297_ref8 – ident: S1471068418000297_ref17 – ident: S1471068418000297_ref19 – ident: S1471068418000297_ref12 doi: 10.1007/978-3-642-30743-0_20 – volume: 8 start-page: 234 year: 1968 ident: S1471068418000297_ref21 article-title: On the complexity of derivation in the propositional calculus publication-title: Zapiski nauchnykh seminarov LOMI – ident: S1471068418000297_ref1 doi: 10.1080/11663081.2013.798985 – volume: 1 start-page: 51 year: 1994 ident: S1471068418000297_ref9 article-title: Consistency of Clark's completion and the existence of stable models publication-title: Journal of Methods of Logic in Computer Science – ident: S1471068418000297_ref11 doi: 10.1017/S1471068418000054 – ident: S1471068418000297_ref4 doi: 10.1007/978-3-642-32211-2_5 – ident: S1471068418000297_ref6 doi: 10.1017/S1471068415000307 – ident: S1471068418000297_ref7 – ident: S1471068418000297_ref18 doi: 10.1109/SFCS.1977.32 – volume-title: Features and fluents: the representation of knowledge about dynamical systems year: 1994 ident: S1471068418000297_ref20 – volume: 3 start-page: 193 year: 1998 ident: S1471068418000297_ref13 article-title: Action languages publication-title: Electronic Transactions on Artificial Intelligence – volume-title: Sitzungsberichte der Preussischen Akademie der Wissenschaften year: 1930 ident: S1471068418000297_ref14 – ident: S1471068418000297_ref3 doi: 10.1007/978-3-642-15675-5_8 – ident: S1471068418000297_ref10 doi: 10.1007/3-540-51803-7_36 |
| SSID | ssj0016324 |
| Score | 2.3647878 |
| Snippet | In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 406 |
| SubjectTerms | Logic programming Logic programs Mathematical programming Operators Temporal logic |
| Title | Temporal Answer Set Programming on Finite Traces |
| URI | https://www.cambridge.org/core/product/identifier/S1471068418000297/type/journal_article https://www.proquest.com/docview/2086205219 |
| Volume | 18 |
| WOSCitedRecordID | wos000441294400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1475-3081 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: K7- dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1475-3081 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_o5sGL8xOnc_TgSQy0adO0J1HZEIRRZMLwUpqPgqDd3Kr--7606eYQdvHSQj4g5CXv917y8n4AlyqUSqPzQ3z8kQABkohMMOKFkaA5pZwqVZFN8NEomkzixB64LWxYZaMTK0WtptKckaOTjra3eWka38w-iGGNMrerlkJjG9oepZ5Z54-cLG8RTCry6nURN9E9UdDcapqU0abQlHmRWxE4_c6tsI5R6yq6wp1h578j3oc9a3E6t_USOYAtXRxCp2FzcOzmPgJ3XGepwqbF4tvU6NJJ6vCtdwQ4Z1o4w1djojoIcKhejuF5OBjfPxDLp0Ak4nBJBItDTwboQfgS3R6hQ-0j3rPcRzFqX0WM61hkecwUFRJ9CcmpzxRTKFD025R_Aq1iWuhTcPLMlSKOAilzNGlcFYWSZtoTEu0LqQTvwvVyNlO7KxZpHVHG0z-T3wW3mfBU2tzkhiLjbVOXq2WXWZ2YY1PjXiOi1WhW8jnbXH0Ou2gmRXWQbg9a5fxTX8CO_CpfF_M-tO8Go-SpXy09_Cbs5QfnBtqq |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60CnqxPrFadQ96EQPJ5n0QEbW0tJYeKhQvsfsIFDStTbT4p_yNzubRWoTeevAU2EfYzczu9012dgbgXDhcSDR-NBMfmoUAqbE-szXD8RgNKXWpEGmyCbfd9no9v7MC38VdGOVWWeyJ6UYthlz9I0cjHbm3umnq34zeNZU1Sp2uFik0MrVoyq8JmmzxdeMe5XtBae2he1fX8qwCGkc0SjRm-47BLeTRJkfyz6QjTUQ9OzRxMtIUnu1Kn_VD3xaUcWTU3KWmLWyB00LrRZj43lVYsyw0lnD9dOzn6amFCn2e3mZylTeRZxWnqCpEtSpUZYanpwmjfsdymMfEeUhIca5W_m9faBu2ckZNbrMlsAMrMtqFcpGtguSb1x7o3SwKFzaN4omqkQnpZO5pbwjgZBiR2kBRcIIAjtvnPjwtZdwHUIqGkTwEEvZ1znzP4jxEyqYLz-G0Lw3GkT9xwdwKXE2lF-SrPg4yjzk3-CPsCuiFgAOex15XKUBeF3W5nHYZZYFHFjWuFioxG81MH44WV5_BRr372ApajXbzGDaREnqZQ3IVSsn4Q57AOv9MBvH4NFV3Ai_L1p4fD4k1tg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Temporal+Answer+Set+Programming+on+Finite+Traces&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=CABALAR%2C+PEDRO&rft.au=Kaminski%2C+Roland&rft.au=Schaub%2C+Torsten&rft.au=Schuhmann%2C+Anna&rft.date=2018-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=18&rft.issue=3-4&rft.spage=406&rft.epage=420&rft_id=info:doi/10.1017%2FS1471068418000297 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon |