Extending constraint logic programming for temporal reasoning

In recent years, several constraint‐based temporal reasoning frameworks have been proposed. They consider temporal points or intervals as domain elements linked by temporal constraints. Temporal reasoning in these systems is based on constraint propagation. In this paper, we argue that a language ba...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 22; no. 1-2; pp. 139 - 158
Main Authors:	Lamma, Evelina, Milano, Michela, Mello, Paola
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Nature B.V 01.02.1998
Subjects:	Algorithms Logic programming Propagation Reasoning Temporal logic
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In recent years, several constraint‐based temporal reasoning frameworks have been proposed. They consider temporal points or intervals as domain elements linked by temporal constraints. Temporal reasoning in these systems is based on constraint propagation. In this paper, we argue that a language based on constraint propagation can be a suitable tool for expressing and reasoning about temporal problems. We concentrate on Constraint Logic Programming (CLP) which is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an “arc consistency” propagation algorithm which is embedded in the inference engine, cannot be changed by the user, and is too weak in many temporal frameworks. Second, CLP is not able to deal with qualitative temporal constraints. We present a general meta CLP architecture which maintains the advantages of CLP, but overcomes these two main limitations. Each architectural level is a finite domain constraint solver(CLP(FD)) that reasons about constraints of the underlying level. Based on this conceptual architecture, we extend the CLP(FD)language and we specialize the extension proposed on Vilain and Kautz’sPoint Algebra, on Allen’s Interval Algebra and on the STP framework by Dechter, Meiri and Pearl. In particular, we show that we can cope effectively with disjunctive constraints even in an interval‐based framework.
AbstractList	In recent years, several constraint‐based temporal reasoning frameworks have been proposed. They consider temporal points or intervals as domain elements linked by temporal constraints. Temporal reasoning in these systems is based on constraint propagation. In this paper, we argue that a language based on constraint propagation can be a suitable tool for expressing and reasoning about temporal problems. We concentrate on Constraint Logic Programming (CLP) which is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an “arc consistency” propagation algorithm which is embedded in the inference engine, cannot be changed by the user, and is too weak in many temporal frameworks. Second, CLP is not able to deal with qualitative temporal constraints. We present a general meta CLP architecture which maintains the advantages of CLP, but overcomes these two main limitations. Each architectural level is a finite domain constraint solver(CLP(FD)) that reasons about constraints of the underlying level. Based on this conceptual architecture, we extend the CLP(FD)language and we specialize the extension proposed on Vilain and Kautz’sPoint Algebra, on Allen’s Interval Algebra and on the STP framework by Dechter, Meiri and Pearl. In particular, we show that we can cope effectively with disjunctive constraints even in an interval‐based framework.
Author	Milano, Michela Mello, Paola Lamma, Evelina
Author_xml	– sequence: 1 givenname: Evelina surname: Lamma fullname: Lamma, Evelina – sequence: 2 givenname: Michela surname: Milano fullname: Milano, Michela – sequence: 3 givenname: Paola surname: Mello fullname: Mello, Paola
BookMark	eNp1UE1LAzEQDVLBtnr2uuB57eRrNxE8lFI_oOBFzyGbJmXLblKTFPTfm6IXBU8zzLw3782boYkP3iJ0jeEWA6GL5R0GLCRrKEhK5BmaYt7SumUtTEoPmNSEMXqBZintAUA2opmi-_VHtn7b-11lgk856t7nagi73lSHGHZRj-Np6UKssh0PIeqhilan4Mv4Ep07PSR79VPn6O1h_bp6qjcvj8-r5aY2pGlz3QFo0kkJujWSbalwTFPBrXCac-00FqYDVvw42XaWEgPWcd4SDII2khM6Rzffd4ul96NNWe3DMfoiqYjEAkvCJC0o_o0yMaQUrVOmzzr3wZ_eGhQGdUpKLdWvpApv8Yd3iP2o4-e_jC9aXms_
CitedBy_id	crossref_primary_10_1080_088395102753365771 crossref_primary_10_1016_S0743_1066_98_10016_X
Cites_doi	10.7551/mitpress/2122.003.0005 10.1016/0743-1066(94)90033-7 10.1145/359642.359654 10.1109/PROC.1986.13633 10.1007/978-94-009-0349-4_14 10.1007/BFb0016854 10.1145/41625.41635 10.1007/978-3-642-83189-8 10.1016/0743-1066(90)90052-7 10.1016/0004-3702(77)90007-8 10.1145/182.358434 10.7551/mitpress/4299.003.0039
ContentType	Journal Article
Copyright	Kluwer Academic Publishers 1998.
Copyright_xml	– notice: Kluwer Academic Publishers 1998.
DBID	AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS
DOI	10.1023/A:1018946309329
DatabaseName	CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection 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 ProQuest Engineering Collection Engineering 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 Engineering collection
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	Computer Science Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central - New (Subscription) url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1573-7470
EndPage	158
ExternalDocumentID	10_1023_A_1018946309329
GroupedDBID	-Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACSTC ACZOJ ADHHG ADHIR ADHKG ADKFA ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV KOW LAK LLZTM M4Y M7S MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PHGZM PHGZT PQGLB PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~A9 ~EX 8FE 8FG AESKC AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c267t-b00a2b990a7c94d38f4a385e8fa55afa18cb04686f97be32c0ef5572108369523
IEDL.DBID	M7S
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000072546000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1012-2443
IngestDate	Wed Nov 05 14:58:58 EST 2025 Tue Nov 18 22:22:01 EST 2025 Sat Nov 29 07:57:28 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1-2
Language	English
License	https://www.springernature.com/gp/researchers/text-and-data-mining
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c267t-b00a2b990a7c94d38f4a385e8fa55afa18cb04686f97be32c0ef5572108369523
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2918192493
PQPubID	2043872
PageCount	20
ParticipantIDs	proquest_journals_2918192493 crossref_citationtrail_10_1023_A_1018946309329 crossref_primary_10_1023_A_1018946309329
PublicationCentury	1900
PublicationDate	19980201
PublicationDateYYYYMMDD	1998-02-01
PublicationDate_xml	– month: 02 year: 1998 text: 19980201 day: 01
PublicationDecade	1990
PublicationPlace	Dordrecht
PublicationPlace_xml	– name: Dordrecht
PublicationTitle	Annals of mathematics and artificial intelligence
PublicationYear	1998
Publisher	Springer Nature B.V
Publisher_xml	– name: Springer Nature B.V
References	K.A. Bowen (325460_CR5) 1982 R. Dechter (325460_CR10) 1991; 49 325460_CR4 325460_CR3 325460_CR30 P. VanBeek (325460_CR32) 1992; 58 P. Van Hentenryck (325460_CR36) 1992; 57 325460_CR12 325460_CR34 325460_CR11 325460_CR31 P. Van Hentenryck (325460_CR38) 1992; 58 M. Dincbas (325460_CR13) 1990; 8 325460_CR15 325460_CR37 325460_CR14 325460_CR35 325460_CR18 325460_CR17 325460_CR39 J.F. Allen (325460_CR2) 1983; 26 L. Aiello (325460_CR1) 1986; 74 J. Jaffar (325460_CR19) 1994; 19 P. VanBeek (325460_CR33) 1990; 6 T.L. Dean (325460_CR9) 1987; 32 E.C. Freuder (325460_CR16) 1978; 21 325460_CR23 A.K. Mackworth (325460_CR26) 1977; 8 325460_CR8 325460_CR22 325460_CR7 325460_CR21 325460_CR6 325460_CR20 325460_CR27 325460_CR25 325460_CR24 R. Mohr (325460_CR28) 1986; 28 325460_CR29
References_xml	– ident: 325460_CR15 – ident: 325460_CR35 doi: 10.7551/mitpress/2122.003.0005 – ident: 325460_CR17 – volume: 28 start-page: 225 year: 1986 ident: 325460_CR28 publication-title: Arc and path consistency revisited, Artificial Intelligence – ident: 325460_CR3 – ident: 325460_CR11 – ident: 325460_CR34 – volume: 19 start-page: 503 year: 1994 ident: 325460_CR19 publication-title: Special Issue on 10 years of Logic Programming doi: 10.1016/0743-1066(94)90033-7 – volume: 57 start-page: 291 year: 1992 ident: 325460_CR36 publication-title: A generic arc-consistency algorithm and its specializations, Artificial Intelligence – volume: 21 start-page: 958 issue: 11 year: 1978 ident: 325460_CR16 publication-title: Communications of the ACM doi: 10.1145/359642.359654 – volume: 74 start-page: 1304 issue: 10 year: 1986 ident: 325460_CR1 publication-title: Proc. IEEE doi: 10.1109/PROC.1986.13633 – ident: 325460_CR31 – ident: 325460_CR21 doi: 10.1007/978-94-009-0349-4_14 – volume: 58 start-page: 297 year: 1992 ident: 325460_CR32 publication-title: Reasoning about qualitative temporal information, Artificial Intelligence – volume: 32 start-page: 1 year: 1987 ident: 325460_CR9 publication-title: Temporal data base management, Artificial Intelligence – start-page: 153 volume-title: Logic Programming year: 1982 ident: 325460_CR5 – ident: 325460_CR22 – ident: 325460_CR24 – ident: 325460_CR7 doi: 10.1007/BFb0016854 – ident: 325460_CR18 doi: 10.1145/41625.41635 – ident: 325460_CR25 doi: 10.1007/978-3-642-83189-8 – ident: 325460_CR14 – ident: 325460_CR20 – volume: 58 start-page: 113 issue: 1–2 year: 1992 ident: 325460_CR38 publication-title: Constraint satisfaction using constraint logic programming, Artificial Intelligence – volume: 8 start-page: 75 issue: 1–2 year: 1990 ident: 325460_CR13 publication-title: Journal of Logic Programming doi: 10.1016/0743-1066(90)90052-7 – volume: 8 start-page: 99 year: 1977 ident: 325460_CR26 publication-title: Consistency in networks of relations, Artificial Intelligence doi: 10.1016/0004-3702(77)90007-8 – ident: 325460_CR12 – volume: 26 start-page: 832 year: 1983 ident: 325460_CR2 publication-title: Communications of the ACM doi: 10.1145/182.358434 – ident: 325460_CR37 – volume: 6 start-page: 132 year: 1990 ident: 325460_CR33 publication-title: Exact and approximate reasoning about temporal relations, Computational Intelligence – ident: 325460_CR39 – ident: 325460_CR29 – ident: 325460_CR30 – ident: 325460_CR27 – ident: 325460_CR8 – ident: 325460_CR23 doi: 10.7551/mitpress/4299.003.0039 – ident: 325460_CR4 – ident: 325460_CR6 – volume: 49 start-page: 61 year: 1991 ident: 325460_CR10 publication-title: Temporal constraint networks, Artificial Intelligence
SSID	ssj0009686
Score	1.4786545
Snippet	In recent years, several constraint‐based temporal reasoning frameworks have been proposed. They consider temporal points or intervals as domain elements...
SourceID	proquest crossref
SourceType	Aggregation Database Enrichment Source Index Database
StartPage	139
SubjectTerms	Algorithms Logic programming Propagation Reasoning Temporal logic
Title	Extending constraint logic programming for temporal reasoning
URI	https://www.proquest.com/docview/2918192493
Volume	22
WOSCitedRecordID	wos000072546000007&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: AAdvanced Technologies & Aerospace Database (subscription) customDbUrl: eissn: 1573-7470 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: P5Z dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7470 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: K7- dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1573-7470 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: M7S dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central - New (Subscription) customDbUrl: eissn: 1573-7470 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: BENPR dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7470 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT8IwFH8R8KAHUdSIIunBg5cq7KvtwRg0EBOVED8S4mXpujYxQUA2_fttSwdiohcvu3Rbtr7X99XX3w_ghEppIvMIUyl8HGiPiWmgPJwy4idpxINAWMj8O9Lv0-GQDVzBLXNtlYVNtIY6nQhTIz_3WJvaZMG_nL5jwxpldlcdhUYJKgYloW1b9x6XoLuRZXo0EFZYuzH_B7RPm7IgMjuBNr785pVWjbL1NL3qf79xG7ZcjIk6c6XYgTU5rkG14G9AbjnXYPN-gdma7cJF19bDtStDwgSNhjsiR9Y0ItfF9WYGdZSLHKDVCJmWdlvQ3YPnXvfp-gY7cgUsvIjkhniHe4n2RZwIFqQ-VQH3aSip4mHIFW9TkejcmUaKkUT6nmhJFYY6XzRw1kynr_tQHk_G8gBQyEkaqVTPo0lveJIo1tLv02pAiCBJUoezYnJj4ZDHzU-MYrsD7vlxJ16RRh1OFw9M56Abv9_aKEQRu9WXxUs5HP49fAQb8zOGpj2lAeV89iGPYV185q_ZrAmVq25_8NCE0i3BTata-joIX74AuMfTJA
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB5kFdSDb3F95qDgJbrbtE1yEBF1UXZdPKzgraZpCsK66rYq_il_o5m09QV624PntIV0Jt_MJJPvA9gWxmBmHlJhNKO-jZhU-KlHE8lZnITK97WjzO_wbldcX8vLMXir7sJgW2WFiQ6ok3uNe-T7nmwKVyyww4dHiqpReLpaSWgUbtE2ry-2ZMsOzk-sfXc8r3XaOz6jpaoA1V7Ic1ScUV5sQVhxLf2EidRXTARGpCoIVKqaQse2aBRhKnlsmKcbJg0CWyghj7MMkOjAQv64zwTHddXm9JPkN3TKkkiZRW3YZD-ohJpC-iGePLp89ksU_B4EXGRrzf63fzIHM2UOTY4Kp5-HMTNYgNlKn4KUcLUA0xcfnLTZIhycuv1-G6qJxqQYtTFy4qCflF1qdzhos3hSEnb1Cbbsuw3rJbgayZSWoTa4H5gVIIHiSZgm1m5Yvqk4TmXDfs-6Oeeax3Ed9ipjRrpkVsdJ9CN3wu-x6Cj6Zv067H688FCQivz-6Hpl-qhElyz6tPvq38NbMHnWu-hEnfNuew2mivuU2IqzDrV8-GQ2YEI_57fZcNM5MoGbUXvJO_-vKx8
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=Extending+constraint+logic+programming+for+temporal+reasoning&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=Lamma%2C+Evelina&rft.au=Milano%2C+Michela&rft.au=Mello%2C+Paola&rft.date=1998-02-01&rft.pub=Springer+Nature+B.V&rft.issn=1012-2443&rft.eissn=1573-7470&rft.volume=22&rft.issue=1-2&rft.spage=139&rft.epage=158&rft_id=info:doi/10.1023%2FA%3A1018946309329
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon