Linear-Time Temporal Answer Set Programming

In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time...

Full description

Saved in:

Bibliographic Details
Published in:	Theory and practice of logic programming Vol. 23; no. 1; pp. 2 - 56
Main Authors:	AGUADO, FELICIDAD, CABALAR, PEDRO, DIÉGUEZ, MARTÍN, PÉREZ, GILBERTO, SCHAUB, TORSTEN, SCHUHMANN, ANNA, VIDAL, CONCEPCIÓN
Format:	Journal Article
Language:	English
Published:	Cambridge Cambridge University Press 01.01.2023 Cambridge University Press (CUP)
Subjects:	Computer Science Declarative programming Equilibrium Formalism Knowledge representation Logic programming Logic programs Mathematical programming Semantics Solvers Syntax Temporal logic
ISSN:	1471-0684, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). In the paper, we focus on the main recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL but involves a model selection criterion based on Equilibrium Logic , a well known logical characterization of Answer Set Programming (ASP). As a result, we obtain a proper extension of the stable models semantics for the general case of temporal formulas in the syntax of LTL. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. We also provide further useful results, such as the translation into other formalisms like Quantified Equilibrium Logic and Second-order LTL, and some techniques for computing temporal stable models based on automata constructions. In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction of the solver telingo , a temporal extension of the well-known ASP solver clingo that uses its incremental solving capabilities.
AbstractList	In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). In the paper, we focus on the main recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL but involves a model selection criterion based on Equilibrium Logic, a well known logical characterization of Answer Set Programming (ASP). As a result, we obtain a proper extension of the stable models semantics for the general case of temporal formulas in the syntax of LTL. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. We also provide further useful results, such as the translation into other formalisms like Quantified Equilibrium Logic and Second-order LTL, and some techniques for computing temporal stable models based on automata constructions. In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction of the solver telingo, a temporal extension of the well-known ASP solver clingo that uses its incremental solving capabilities. Abstract In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). In the paper, we focus on the main recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL but involves a model selection criterion based on Equilibrium Logic , a well known logical characterization of Answer Set Programming (ASP). As a result, we obtain a proper extension of the stable models semantics for the general case of temporal formulas in the syntax of LTL. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. We also provide further useful results, such as the translation into other formalisms like Quantified Equilibrium Logic and Second-order LTL, and some techniques for computing temporal stable models based on automata constructions. In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction of the solver telingo , a temporal extension of the well-known ASP solver clingo that uses its incremental solving capabilities. In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). In the paper, we focus on the main recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL but involves a model selection criterion based on Equilibrium Logic , a well known logical characterization of Answer Set Programming (ASP). As a result, we obtain a proper extension of the stable models semantics for the general case of temporal formulas in the syntax of LTL. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. We also provide further useful results, such as the translation into other formalisms like Quantified Equilibrium Logic and Second-order LTL, and some techniques for computing temporal stable models based on automata constructions. In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction of the solver telingo , a temporal extension of the well-known ASP solver clingo that uses its incremental solving capabilities.
Author	DIÉGUEZ, MARTÍN VIDAL, CONCEPCIÓN SCHUHMANN, ANNA AGUADO, FELICIDAD SCHAUB, TORSTEN CABALAR, PEDRO PÉREZ, GILBERTO
Author_xml	– sequence: 1 givenname: FELICIDAD surname: AGUADO fullname: AGUADO, FELICIDAD – sequence: 2 givenname: PEDRO orcidid: 0000-0001-7440-0953 surname: CABALAR fullname: CABALAR, PEDRO – sequence: 3 givenname: MARTÍN orcidid: 0000-0003-3440-4348 surname: DIÉGUEZ fullname: DIÉGUEZ, MARTÍN – sequence: 4 givenname: GILBERTO surname: PÉREZ fullname: PÉREZ, GILBERTO – sequence: 5 givenname: TORSTEN orcidid: 0000-0002-7456-041X surname: SCHAUB fullname: SCHAUB, TORSTEN – sequence: 6 givenname: ANNA surname: SCHUHMANN fullname: SCHUHMANN, ANNA – sequence: 7 givenname: CONCEPCIÓN surname: VIDAL fullname: VIDAL, CONCEPCIÓN
BackLink	https://hal.science/hal-04036719$$DView record in HAL
BookMark	eNp1kFFLwzAUhYNMcJv-AN8KPolU722aJn0cQ51QUNh8DmmbzIw2mWmn-O_tnL4oPt3Lud-5HM6EjJx3mpBzhGsE5DdLTDlCJtIEAYAxfkTGg8RiCgJHXzvG-_sJmXTdBgAzmqRjclVYp1WIV7bV0Uq3Wx9UE81c965DtNR99BT8Oqi2tW59So6Najp99j2n5PnudjVfxMXj_cN8VsQVZdDHnJZ1yU1O0ZQCuEpLY1jNa6ZEUmKVUZonORdVyjKBNUtqXqUCea2hFJpqQ6fk8vD3RTVyG2yrwof0ysrFrJB7DVKgGcf8DQf24sBug3_d6a6XG78LbognE5EnNGPAYaD4gaqC77qgjaxsr3rrXR-UbSSC3Lco_7Q4OPGX8yfQ_55PmMpydQ
CitedBy_id	crossref_primary_10_3390_a16030169 crossref_primary_10_3390_s25185790 crossref_primary_10_1016_j_artint_2024_104236 crossref_primary_10_1080_13875868_2024_2411052 crossref_primary_10_4204_EPTCS_416_32 crossref_primary_10_3390_computers13040086 crossref_primary_10_1017_S1471068425100203 crossref_primary_10_1080_11663081_2023_2244365
Cites_doi	10.1016/S0004-3702(99)00071-5 10.7551/mitpress/2516.001.0001 10.1007/978-3-540-89982-2_46 10.1007/BF03037381 10.1109/SFCS.1977.32 10.1016/S0747-7171(89)80070-7 10.1007/BFb0023801 10.1007/3-540-45329-6_31 10.1007/978-3-319-46520-3_8 10.1023/A:1016636131405 10.1007/978-3-642-32211-2_5 10.1016/S0004-3702(02)00186-8 10.1007/BFb0014005 10.1006/jsco.1996.0066 10.1017/S1471068411000639 10.1017/S1471068415000307 10.1007/s10115-010-0294-z 10.1017/S1471068420000307 10.24963/ijcai.2019/261 10.1145/567446.567462 10.24963/kr.2021/58 10.1007/3-540-49059-0_14 10.1016/j.apal.2010.09.009 10.1007/978-3-540-75867-9_31 10.1007/3-540-51803-7_36 10.1007/3-540-60630-0_5 10.1016/S0304-3975(02)00447-4 10.1007/978-3-319-48758-8_6 10.1080/11663081.2018.1427987 10.1016/S0743-1066(96)00121-5 10.24963/ijcai.2018/848 10.1017/S1471068418000054 10.1093/jigpal/9.2.273 10.1017/S1471068418000297 10.1007/978-3-642-40564-8_3 10.1145/504077.504079 10.1109/LICS.2015.65 10.1093/logcom/9.5.701 10.1016/S1574-6526(05)80014-8 10.1007/978-3-030-30244-3_43 10.1017/S1471068415000277 10.1080/11663081.2013.798985 10.1016/0743-1066(93)90035-F 10.1016/0022-0000(79)90046-1 10.1109/ICTAI.2012.87 10.1017/S1471068403001790 10.1145/321978.321991 10.1007/3-540-16492-8_119 10.24963/ijcai.2017/189 10.1145/151634.151635 10.1109/TIME.2008.14 10.1145/3828.3837 10.1007/978-3-030-22102-7_8 10.1016/0304-3975(87)90008-9 10.1016/S0019-9958(83)80051-5 10.1007/978-3-662-46678-0_11 10.1007/978-3-030-14812-6_43 10.1007/978-0-387-34892-6_1 10.1007/978-3-642-20895-9_43 10.1145/322234.322243 10.1145/308386.308416 10.1017/S1471068416000570 10.1007/BFb0012886 10.1016/S0168-0072(98)00039-6 10.1007/BFb0023805 10.1007/978-3-030-20528-7_19 10.1007/978-94-009-5203-4_4
ContentType	Journal Article
Copyright	The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: Distributed under a Creative Commons Attribution 4.0 International License
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 1XC
DOI	10.1017/S1471068421000557
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) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central 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 ProQuest advanced technologies & aerospace journals 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 Hyper Article en Ligne (HAL)
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	Computer Science Database CrossRef
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central (NC Live) url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1475-3081
EndPage	56
ExternalDocumentID	oai:HAL:hal-04036719v1 10_1017_S1471068421000557
GroupedDBID	-E. .FH 09C 09E 0E1 0R~ 123 29Q 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYXX ABBXD ABGDZ ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABXHF ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AFFHD AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKMAY 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 CITATION CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IPYYG IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V NIKVX O9- OYBOY P2P P62 PHGZM PHGZT PQGLB PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WYP ZYDXJ 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI PRINS Q9U 1XC
ID	FETCH-LOGICAL-c350t-73bdb7f931fb807a4bff5d7d5a82b1c63392978c45681d52d7c4817de0b8e3ef3
IEDL.DBID	K7-
ISICitedReferencesCount	17
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000734879100001&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	Tue Oct 14 21:09:54 EDT 2025 Sun Nov 09 07:31:45 EST 2025 Sat Nov 29 04:58:37 EST 2025 Tue Nov 18 21:08:29 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c350t-73bdb7f931fb807a4bff5d7d5a82b1c63392978c45681d52d7c4817de0b8e3ef3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-7440-0953 0000-0002-7456-041X 0000-0003-3440-4348
OpenAccessLink	https://www.cambridge.org/core/services/aop-cambridge-core/content/view/AB07F1F913DC0068B22E2A929276EDD2/S1471068421000557a.pdf/div-class-title-linear-time-temporal-answer-set-programming-div.pdf
PQID	2892365070
PQPubID	43613
PageCount	55
ParticipantIDs	hal_primary_oai_HAL_hal_04036719v1 proquest_journals_2892365070 crossref_citationtrail_10_1017_S1471068421000557 crossref_primary_10_1017_S1471068421000557
PublicationCentury	2000
PublicationDate	2023-01-00 20230101 2023-01
PublicationDateYYYYMMDD	2023-01-01
PublicationDate_xml	– month: 01 year: 2023 text: 2023-01-00
PublicationDecade	2020
PublicationPlace	Cambridge
PublicationPlace_xml	– name: Cambridge
PublicationTitle	Theory and practice of logic programming
PublicationYear	2023
Publisher	Cambridge University Press Cambridge University Press (CUP)
Publisher_xml	– name: Cambridge University Press – name: Cambridge University Press (CUP)
References	Hosoi (S1471068421000557_ref81) 1966; 2 S1471068421000557_ref15 S1471068421000557_ref16 S1471068421000557_ref17 S1471068421000557_ref19 S1471068421000557_ref95 (S1471068421000557_ref8) 1983; 11 S1471068421000557_ref96 S1471068421000557_ref97 S1471068421000557_ref10 S1471068421000557_ref98 S1471068421000557_ref99 S1471068421000557_ref12 S1471068421000557_ref13 S1471068421000557_ref90 S1471068421000557_ref91 S1471068421000557_ref92 S1471068421000557_ref94 S1471068421000557_ref84 S1471068421000557_ref85 S1471068421000557_ref86 S1471068421000557_ref87 S1471068421000557_ref88 S1471068421000557_ref80 S1471068421000557_ref82 S1471068421000557_ref83 S1471068421000557_ref73 S1471068421000557_ref74 S1471068421000557_ref75 S1471068421000557_ref76 S1471068421000557_ref77 S1471068421000557_ref78 S1471068421000557_ref79 S1471068421000557_ref70 S1471068421000557_ref71 S1471068421000557_ref62 S1471068421000557_ref63 S1471068421000557_ref64 S1471068421000557_ref65 S1471068421000557_ref66 S1471068421000557_ref67 S1471068421000557_ref68 S1471068421000557_ref69 Gödel (S1471068421000557_ref72) 1932 Baader (S1471068421000557_ref11) 2003 S1471068421000557_ref60 S1471068421000557_ref61 S1471068421000557_ref59 S1471068421000557_ref52 S1471068421000557_ref53 S1471068421000557_ref55 S1471068421000557_ref56 S1471068421000557_ref57 S1471068421000557_ref58 S1471068421000557_ref50 S1471068421000557_ref103 S1471068421000557_ref104 S1471068421000557_ref105 S1471068421000557_ref106 Moszkowski (S1471068421000557_ref93) 1986 S1471068421000557_ref107 S1471068421000557_ref108 S1471068421000557_ref109 Demri (S1471068421000557_ref51) 2016 S1471068421000557_ref48 S1471068421000557_ref49 S1471068421000557_ref100 S1471068421000557_ref101 S1471068421000557_ref102 S1471068421000557_ref6 S1471068421000557_ref40 S1471068421000557_ref41 S1471068421000557_ref7 S1471068421000557_ref42 S1471068421000557_ref4 S1471068421000557_ref43 S1471068421000557_ref5 S1471068421000557_ref44 S1471068421000557_ref45 S1471068421000557_ref46 S1471068421000557_ref47 S1471068421000557_ref9 S1471068421000557_ref2 S1471068421000557_ref3 S1471068421000557_ref1 S1471068421000557_ref37 S1471068421000557_ref38 S1471068421000557_ref39 S1471068421000557_ref110 S1471068421000557_ref111 Fages (S1471068421000557_ref54) 1994 S1471068421000557_ref112 S1471068421000557_ref30 S1471068421000557_ref31 S1471068421000557_ref32 Lukasiewicz (S1471068421000557_ref89) 1941; 6–9 S1471068421000557_ref33 S1471068421000557_ref34 S1471068421000557_ref35 S1471068421000557_ref36 S1471068421000557_ref26 S1471068421000557_ref27 S1471068421000557_ref28 S1471068421000557_ref29 S1471068421000557_ref20 S1471068421000557_ref21 S1471068421000557_ref22 S1471068421000557_ref23 S1471068421000557_ref24 S1471068421000557_ref25 Balbiani (S1471068421000557_ref14) 2020; 2 Baudinet (S1471068421000557_ref18) 1993
References_xml	– ident: S1471068421000557_ref31 – start-page: 65 year: 1932 ident: S1471068421000557_ref72 article-title: Zum intuitionistischen Aussagenkalkül publication-title: Anzeiger der Akademie der Wissenschaften in Wien – ident: S1471068421000557_ref13 doi: 10.1016/S0004-3702(99)00071-5 – ident: S1471068421000557_ref76 doi: 10.7551/mitpress/2516.001.0001 – volume: 6–9 start-page: 82 year: 1941 ident: S1471068421000557_ref89 article-title: Die logik und das grundlagenproblem publication-title: Les Entreties de Zürich sur les Fondaments et la Méthode des Sciences Mathématiques 12 – ident: S1471068421000557_ref98 doi: 10.1007/978-3-540-89982-2_46 – ident: S1471068421000557_ref55 doi: 10.1007/BF03037381 – ident: S1471068421000557_ref83 – ident: S1471068421000557_ref100 doi: 10.1109/SFCS.1977.32 – ident: S1471068421000557_ref1 doi: 10.1016/S0747-7171(89)80070-7 – volume-title: The Description Logic Handbook: Theory, Implementation, and Applications year: 2003 ident: S1471068421000557_ref11 – ident: S1471068421000557_ref96 doi: 10.1007/BFb0023801 – ident: S1471068421000557_ref28 – ident: S1471068421000557_ref97 doi: 10.1007/3-540-45329-6_31 – ident: S1471068421000557_ref52 doi: 10.1007/978-3-319-46520-3_8 – ident: S1471068421000557_ref20 – ident: S1471068421000557_ref59 – ident: S1471068421000557_ref9 doi: 10.1023/A:1016636131405 – ident: S1471068421000557_ref32 doi: 10.1007/978-3-642-32211-2_5 – volume-title: Executing Temporal Logic Programs year: 1986 ident: S1471068421000557_ref93 – ident: S1471068421000557_ref34 – volume: 11 start-page: 832 year: 1983 ident: S1471068421000557_ref8 article-title: Maintaining knowledge about temporal intervals publication-title: Communications of the ACM 26 – ident: S1471068421000557_ref88 doi: 10.1016/S0004-3702(02)00186-8 – ident: S1471068421000557_ref58 doi: 10.1007/BFb0014005 – ident: S1471068421000557_ref60 doi: 10.1006/jsco.1996.0066 – ident: S1471068421000557_ref70 doi: 10.1017/S1471068411000639 – ident: S1471068421000557_ref37 doi: 10.1017/S1471068415000307 – ident: S1471068421000557_ref94 – ident: S1471068421000557_ref48 doi: 10.1007/s10115-010-0294-z – ident: S1471068421000557_ref36 doi: 10.1017/S1471068420000307 – ident: S1471068421000557_ref108 doi: 10.24963/ijcai.2019/261 – ident: S1471068421000557_ref64 doi: 10.1145/567446.567462 – ident: S1471068421000557_ref109 doi: 10.24963/kr.2021/58 – ident: S1471068421000557_ref23 doi: 10.1007/3-540-49059-0_14 – ident: S1471068421000557_ref85 – ident: S1471068421000557_ref66 – ident: S1471068421000557_ref92 doi: 10.1016/j.apal.2010.09.009 – start-page: 51 year: 1994 ident: S1471068421000557_ref54 article-title: Consistency of Clark’s completion and the existence of stable models publication-title: Journal of Methods of Logic in Computer Science 1 – ident: S1471068421000557_ref42 doi: 10.1007/978-3-540-75867-9_31 – ident: S1471068421000557_ref102 – ident: S1471068421000557_ref62 doi: 10.1007/3-540-51803-7_36 – ident: S1471068421000557_ref80 – ident: S1471068421000557_ref78 doi: 10.1007/3-540-60630-0_5 – ident: S1471068421000557_ref75 doi: 10.1016/S0304-3975(02)00447-4 – ident: S1471068421000557_ref15 doi: 10.1007/978-3-319-48758-8_6 – ident: S1471068421000557_ref3 doi: 10.1080/11663081.2018.1427987 – ident: S1471068421000557_ref99 – ident: S1471068421000557_ref86 doi: 10.1016/S0743-1066(96)00121-5 – ident: S1471068421000557_ref43 doi: 10.24963/ijcai.2018/848 – ident: S1471068421000557_ref65 doi: 10.1017/S1471068418000054 – ident: S1471068421000557_ref91 – ident: S1471068421000557_ref71 doi: 10.1093/jigpal/9.2.273 – ident: S1471068421000557_ref63 – ident: S1471068421000557_ref39 doi: 10.1017/S1471068418000297 – ident: S1471068421000557_ref7 doi: 10.1007/978-3-642-40564-8_3 – ident: S1471068421000557_ref74 doi: 10.1145/504077.504079 – ident: S1471068421000557_ref73 – ident: S1471068421000557_ref50 – ident: S1471068421000557_ref29 – ident: S1471068421000557_ref26 doi: 10.1109/LICS.2015.65 – ident: S1471068421000557_ref21 – ident: S1471068421000557_ref44 doi: 10.1093/logcom/9.5.701 – ident: S1471068421000557_ref10 doi: 10.1016/S1574-6526(05)80014-8 – ident: S1471068421000557_ref40 doi: 10.1007/978-3-030-30244-3_43 – ident: S1471068421000557_ref5 doi: 10.1017/S1471068415000277 – ident: S1471068421000557_ref2 doi: 10.1080/11663081.2013.798985 – ident: S1471068421000557_ref67 doi: 10.1016/0743-1066(93)90035-F – ident: S1471068421000557_ref35 – ident: S1471068421000557_ref57 doi: 10.1016/0022-0000(79)90046-1 – ident: S1471068421000557_ref87 doi: 10.1109/ICTAI.2012.87 – ident: S1471068421000557_ref12 – ident: S1471068421000557_ref77 doi: 10.1017/S1471068403001790 – ident: S1471068421000557_ref107 doi: 10.1145/321978.321991 – ident: S1471068421000557_ref61 doi: 10.1007/3-540-16492-8_119 – ident: S1471068421000557_ref30 – ident: S1471068421000557_ref24 – ident: S1471068421000557_ref49 – ident: S1471068421000557_ref112 doi: 10.24963/ijcai.2017/189 – ident: S1471068421000557_ref47 doi: 10.1145/151634.151635 – volume-title: Cambridge Tracts in Theoretical Computer Science year: 2016 ident: S1471068421000557_ref51 – ident: S1471068421000557_ref17 – ident: S1471068421000557_ref82 – ident: S1471068421000557_ref69 – ident: S1471068421000557_ref101 – ident: S1471068421000557_ref90 doi: 10.1109/TIME.2008.14 – ident: S1471068421000557_ref27 – ident: S1471068421000557_ref104 doi: 10.1145/3828.3837 – ident: S1471068421000557_ref41 doi: 10.1007/978-3-030-22102-7_8 – ident: S1471068421000557_ref105 doi: 10.1016/0304-3975(87)90008-9 – ident: S1471068421000557_ref56 – ident: S1471068421000557_ref110 doi: 10.1016/S0019-9958(83)80051-5 – ident: S1471068421000557_ref25 doi: 10.1007/978-3-662-46678-0_11 – ident: S1471068421000557_ref4 – ident: S1471068421000557_ref111 doi: 10.1007/978-3-030-14812-6_43 – start-page: 294 volume-title: Temporal Databases: Theory, Design, and Implementation year: 1993 ident: S1471068421000557_ref18 – ident: S1471068421000557_ref68 doi: 10.1007/978-0-387-34892-6_1 – ident: S1471068421000557_ref33 doi: 10.1007/978-3-642-20895-9_43 – ident: S1471068421000557_ref45 doi: 10.1145/322234.322243 – ident: S1471068421000557_ref46 doi: 10.1145/308386.308416 – ident: S1471068421000557_ref53 – ident: S1471068421000557_ref6 doi: 10.1017/S1471068416000570 – ident: S1471068421000557_ref95 – volume: 2 year: 2020 ident: S1471068421000557_ref14 article-title: Intuitionistic linear temporal logics publication-title: ACM Transactions on Computational Logic 21 – ident: S1471068421000557_ref22 doi: 10.1007/BFb0012886 – ident: S1471068421000557_ref79 doi: 10.1016/S0168-0072(98)00039-6 – ident: S1471068421000557_ref19 – ident: S1471068421000557_ref16 doi: 10.1007/BFb0023805 – volume: 2 start-page: 183 year: 1966 ident: S1471068421000557_ref81 article-title: The axiomatization of the intermediate propositional systems $s_2$ of Gödel publication-title: Journal of the Faculty of Science of the University of Tokyo 13 – ident: S1471068421000557_ref84 – ident: S1471068421000557_ref38 doi: 10.1007/978-3-030-20528-7_19 – ident: S1471068421000557_ref103 – ident: S1471068421000557_ref106 doi: 10.1007/978-94-009-5203-4_4
SSID	ssj0016324
Score	2.3800933
Snippet	In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem... Abstract In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative...
SourceID	hal proquest crossref
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database
StartPage	2
SubjectTerms	Computer Science Declarative programming Equilibrium Formalism Knowledge representation Logic programming Logic programs Mathematical programming Semantics Solvers Syntax Temporal logic
Title	Linear-Time Temporal Answer Set Programming
URI	https://www.proquest.com/docview/2892365070 https://hal.science/hal-04036719
Volume	23
WOSCitedRecordID	wos000734879100001&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: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241207 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 advanced technologies & aerospace journals customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central (NC Live) customDbUrl: eissn: 1475-3081 dateEnd: 20241207 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/eLvHCXMwpV1LSwMxEB60evBifWK1lkU8CcHNY5vsSapUBKUUUSlels1jUdCt2lr_vpl9VFHw4mUPswmEzGRmMjP5BuBQc2_GBROEOq6J4DIk3g1xJBVdLlIep6545Xp3JQcDNRrFwyrgNqnKKmudWChqOzYYIz_2FwPGvTshw5OXV4JdozC7WrXQWIQlyhhFOb-UZJ5FQCjy4nWRxOoeJeqsJkJGIxFpDAPcEVqnb3Zp8QGrIn8o58LinDf_u9Y1WK18zaBXCsc6LLh8A5p1H4egOtabgBdzL_AEn4MENyVWlZ-WTz5wlJsGw7KI69mbuS24Pe_fnF2QqokCMTwKp0RybbXMYk4zrUKZCp1lkZU2ShXT1HQ5OkhSGYFIZDZiVhqhqLQu1Mpxl_FtaOTj3O1AwLIwFaGWPPP7ZjKbOmqYNFbFRjGq0xaE9RYmpkIYx0YXT0lZSiaTX7vegqP5lJcSXuOvwQeeL_NxCIx90btKkOZVEe9KGs9oC9o1T5LqOE6SL4bs_v17D1awn3wZY2lDY_r27vZh2cymj5O3Diyd9gfD604hZf47jO4_AQX607o
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSwMxEB58gV6sT6zPRfQiBHeTbJM9iIgPKtbSQxXxsm4ei4K2aqvFP-VvNLOPKgrePHjNJkvY-XZmMpn5BmBLMWfGOeUksEwRzoRPnBtiScJrjCcsSmxW5XrZEM2mvLqKWiPwXtbCYFplqRMzRW26GmPku-5gQJlzJ4S___hEsGsU3q6WLTRyWJzZt4E7svX2To-cfLcpPTluH9ZJ0VWAaBb6fSKYMkqkEQtSJX2RcJWmoREmTCRVga4x9BiE1BypuUxIjdBcBsJYX0nLbMrce0dhnHN3WHL_Tyu8Ht5aIPV5Vs0kMJtI8vIWFSmqcRDHKAbUQ7SGX-zg6C1mYX4zBpmFO6n8t28zA9OFL-0d5OCfhRHbmYNK2afCK9TWPGDgwe2OYLmL1865uNyyTm-As2zfa-VJag_OjC_AxZ9seRHGOt2OXQKPpn7CfSVY6uSkU5PYQFOhjYy0pIFKquCXIot1waCOjTzu4zxVTsQ_pFyFneGSx5w-5LfJmw4Hw3lI_F0_aMQ45lQtq4kgeg2qsFpiIC7UTS_-BMDy7483YLLePm_EjdPm2QpMUeex5fGkVRjrP7_YNZjQr_273vN6hmwPbv4aLh-zfi72
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=Linear-Time+Temporal+Answer+Set+Programming&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=Aguado%2C+Felicidad&rft.au=CABALAR%2C+PEDRO&rft.au=DI%C3%89GUEZ%2C+MART%C3%8DN&rft.au=P%C3%89REZ%2C+GILBERTO&rft.date=2023-01-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=1&rft.spage=2&rft.epage=56&rft_id=info:doi/10.1017%2FS1471068421000557
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