Constraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 7; číslo 5; s. 537 - 582 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.09.2007
|
| 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 present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP($\fd$)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe \toy(fd)$, an implementation for CFLP($\fd$), and a comparison of our approach with respect to CLP($\fd$) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP($\fd$) systems and that clearly outperforms the closer approach to CFLP($\fd$). |
|---|---|
| AbstractList | In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP($\fd$)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe \toy(fd)$, an implementation for CFLP($\fd$), and a comparison of our approach with respect to CLP($\fd$) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP($\fd$) systems and that clearly outperforms the closer approach to CFLP($\fd$). In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains ( CFLP ( $\fd$ )) with a lazy functional logic programming language which seamlessly embodies finite domain ( $\fd$ ) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains ( CLP ( $\fd$ )) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe \toy(fd)$ , an implementation for CFLP ( $\fd$ ), and a comparison of our approach with respect to CLP ( $\fd$ ) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP ( $\fd$ ) systems and that clearly outperforms the closer approach to CFLP ( $\fd$ ). Abstract In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP ( $\fd$ )) with a lazy functional logic programming language which seamlessly embodies finite domain ( $\fd$ ) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP ( $\fd$ )) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe \toy(fd)$ , an implementation for CFLP ( $\fd$ ), and a comparison of our approach with respect to CLP ( $\fd$ ) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP ( $\fd$ ) systems and that clearly outperforms the closer approach to CFLP ( $\fd$ ). [PUBLICATION ABSTRACT] |
| Author | HORTALÁ-GONZÁLEZ, TERESA DEL VADO-VÍRSEDA, RAFAEL SÁENZ-PÉREZ, FERNANDO FERNÁNDEZ, ANTONIO J. |
| Author_xml | – sequence: 1 givenname: Antonio surname: Fernandez middlename: J fullname: Fernandez, Antonio J – sequence: 2 givenname: Teresa surname: Hortala-Gonzalez fullname: Hortala-Gonzalez, Teresa – sequence: 3 givenname: Fernando surname: Saenz-Perez fullname: Saenz-Perez, Fernando – sequence: 4 givenname: Rafael surname: Del Vado-Virseda fullname: Del Vado-Virseda, Rafael |
| BookMark | eNp9kMtKxDAUhoOM4MzoA7grLtxVc2vT4EoGbzDgQl2XNJeSoU3GpBV8e1NnQBjR1Tmc83_n8i_AzHmnAThH8ApBxK5fEGUIlhWFJYSYY3oE5qlU5ARWaPado3zqn4BFjBsIUUkwnYOblXdxCMK6ITOjk4P1TnRZ51srs23wbRB9b12b-Q8dMmOdHXSmfJ-AeAqOjeiiPtvHJXi7v3tdPebr54en1e06l4SyIcdEaqk4ZmmhIogRiqFpSkUqjJhqCIWcSNkgU3BVYl5qKYkuKgaxUdI0iCzB5W5uuud91HGoexul7jrhtB9jTQjCGHKchBcHwo0fQ_on1jg9zDmtYBKhnUgGH2PQpt4G24vwWSNYT17Wv7xMDDtgpB3E5NVkXfcvSfak6JtgVat_bvqb-gIxFIf1 |
| CitedBy_id | crossref_primary_10_1016_j_entcs_2009_12_006 crossref_primary_10_1016_j_neucom_2015_01_076 crossref_primary_10_1016_j_entcs_2007_05_037 crossref_primary_10_1016_j_entcs_2007_01_013 crossref_primary_10_1016_j_entcs_2007_01_026 |
| Cites_doi | 10.1016/0743-1066(94)90033-7 10.1145/1085099.1085105 10.1145/582153.582176 10.1016/S0743-1066(98)10029-8 10.1007/BF01189020 10.1007/978-3-662-05138-2 10.1007/3-540-36388-2_22 10.1016/0743-1066(93)90043-G 10.1007/3-540-44716-4_12 10.7551/mitpress/5625.001.0001 10.1006/jsco.1997.0197 10.1007/BFb0033845 10.1016/0743-1066(95)00121-2 10.1016/0743-1066(94)90034-5 10.1007/11559306_10 10.1007/10720084_12 10.1016/0004-3702(80)90051-X 10.1007/3-540-57186-8_79 10.1007/BFb0013825 10.1007/3-540-48685-2_19 10.1145/347476.347484 10.1017/CBO9780511615320 10.1109/18.50388 10.1017/S1471068403001741 10.1007/3-540-54444-5 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2007 Cambridge University Press |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2007 – notice: Cambridge University Press |
| 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/S1471068406002924 |
| 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 Advanced Technologies & Computer Science Collection ProQuest Central Essentials AUTh Library subscriptions: 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 Databases ProQuest One Academic 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 | Computer and Information Systems Abstracts 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 |
| EISSN | 1475-3081 |
| EndPage | 582 |
| ExternalDocumentID | 1453618811 10_1017_S1471068406002924 |
| Genre | Feature |
| 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-c347t-23cecd927324d3173420fb6d38217db34093ccb1f59d6296ecc3e58702fdcfb13 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000250062600002&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 21 14:09:41 EDT 2025 Sun Jul 13 03:44:12 EDT 2025 Tue Nov 18 22:18:52 EST 2025 Sat Nov 29 04:58:33 EST 2025 Tue Jan 21 06:25:34 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | functional logic programming constraint logic programming finite domains |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c347t-23cecd927324d3173420fb6d38217db34093ccb1f59d6296ecc3e58702fdcfb13 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 201699480 |
| PQPubID | 43613 |
| PageCount | 46 |
| ParticipantIDs | proquest_miscellaneous_33122092 proquest_journals_201699480 crossref_primary_10_1017_S1471068406002924 crossref_citationtrail_10_1017_S1471068406002924 cambridge_journals_10_1017_S1471068406002924 |
| PublicationCentury | 2000 |
| PublicationDate | 20070900 2007-09-00 20070901 |
| PublicationDateYYYYMMDD | 2007-09-01 |
| PublicationDate_xml | – month: 09 year: 2007 text: 20070900 |
| PublicationDecade | 2000 |
| 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 | 2007 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068406002924_ref15 Dechter (S1471068406002924_ref13) 2003 S1471068406002924_ref16 S1471068406002924_ref18 S1471068406002924_ref51 S1471068406002924_ref50 S1471068406002924_ref11 S1471068406002924_ref55 S1471068406002924_ref10 del Vado-Vírseda (S1471068406002924_ref14) 2003 S1471068406002924_ref2 S1471068406002924_ref1 S1471068406002924_ref4 S1471068406002924_ref3 López-Fraguas (S1471068406002924_ref36) 1992 Arenas (S1471068406002924_ref6) 1996 S1471068406002924_ref26 Fernández (S1471068406002924_ref19) 2002 S1471068406002924_ref25 Marin (S1471068406002924_ref43) 1999 S1471068406002924_ref29 Loogen (S1471068406002924_ref35) 1993 S1471068406002924_ref5 S1471068406002924_ref8 S1471068406002924_ref20 S1471068406002924_ref22 S1471068406002924_ref9 S1471068406002924_ref21 Marin (S1471068406002924_ref44) 2000 S1471068406002924_ref24 Maluszynski (S1471068406002924_ref41) 1991 Van Hentenryck (S1471068406002924_ref54) 1999 Van Roy (S1471068406002924_ref56) 2004 Fourer (S1471068406002924_ref23) 1993 S1471068406002924_ref39 González-Moreno (S1471068406002924_ref27) 1999 López-Fraguas (S1471068406002924_ref37) 2004 Van Hentenryck (S1471068406002924_ref53) 1989 S1471068406002924_ref31 S1471068406002924_ref30 S1471068406002924_ref32 Tsang (S1471068406002924_ref52) 1993 S1471068406002924_ref34 Middeldorp (S1471068406002924_ref47) 2002; 3 Peyton-Jones (S1471068406002924_ref48) 1987 Gunter (S1471068406002924_ref28) 1990 López-Fraguas (S1471068406002924_ref38) 2004 S1471068406002924_ref49 S1471068406002924_ref40 Dincbas (S1471068406002924_ref17) 1988 Henz (S1471068406002924_ref33) 2000 S1471068406002924_ref46 Marriot (S1471068406002924_ref45) 1998 Darlington (S1471068406002924_ref12) 1992 Wielemaker (S1471068406002924_ref57) 2003 Marin (S1471068406002924_ref42) 2000 Barnier (S1471068406002924_ref7) 2001; 14 |
| References_xml | – start-page: 633 volume-title: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics year: 1990 ident: S1471068406002924_ref28 – ident: S1471068406002924_ref34 doi: 10.1016/0743-1066(94)90033-7 – ident: S1471068406002924_ref21 – start-page: 337 volume-title: Research and Development in Intelligent Systems XIX year: 2002 ident: S1471068406002924_ref19 – ident: S1471068406002924_ref18 doi: 10.1145/1085099.1085105 – ident: S1471068406002924_ref11 doi: 10.1145/582153.582176 – volume-title: The implementation of functional programming languages year: 1987 ident: S1471068406002924_ref48 – ident: S1471068406002924_ref26 doi: 10.1016/S0743-1066(98)10029-8 – volume-title: Foundations of constraint satisfaction year: 1993 ident: S1471068406002924_ref52 – ident: S1471068406002924_ref31 – volume: 3 year: 2002 ident: S1471068406002924_ref47 article-title: Complete selection functions for a lazy conditional narrowing calculus publication-title: Journal of Functional and Logic Programming – ident: S1471068406002924_ref50 – ident: S1471068406002924_ref22 doi: 10.1007/BF01189020 – ident: S1471068406002924_ref24 doi: 10.1007/978-3-662-05138-2 – ident: S1471068406002924_ref20 doi: 10.1007/3-540-36388-2_22 – ident: S1471068406002924_ref1 doi: 10.1016/0743-1066(93)90043-G – volume-title: Concepts, techniques and models of computer programming year: 2004 ident: S1471068406002924_ref56 – start-page: 213 volume-title: ACM SIGPLAN year: 2003 ident: S1471068406002924_ref14 – volume-title: 5th Conference of the Association of Asia-Pacific Operational Research Societies year: 2000 ident: S1471068406002924_ref33 – start-page: 5 volume-title: 5th International Workshop on Rewriting Logic and its Applications (WRLA'2004) year: 2004 ident: S1471068406002924_ref37 – ident: S1471068406002924_ref16 – ident: S1471068406002924_ref40 doi: 10.1007/3-540-44716-4_12 – volume-title: Programming with constraints year: 1998 ident: S1471068406002924_ref45 doi: 10.7551/mitpress/5625.001.0001 – ident: S1471068406002924_ref8 – start-page: 43 volume-title: 6th ACM-SIGPLAN year: 2004 ident: S1471068406002924_ref38 – start-page: 223 volume-title: International Symposium on Principles of Software Evolution (IPSE'2000) year: 2000 ident: S1471068406002924_ref44 – ident: S1471068406002924_ref46 doi: 10.1006/jsco.1997.0197 – ident: S1471068406002924_ref9 doi: 10.1007/BFb0033845 – ident: S1471068406002924_ref30 – start-page: 1 volume-title: 4th International Symposium on Functional and Logic Programming (FLOPS'99) year: 1999 ident: S1471068406002924_ref27 – ident: S1471068406002924_ref51 – ident: S1471068406002924_ref10 doi: 10.1016/0743-1066(95)00121-2 – volume-title: AMPL: A modeling language for mathematical programming year: 1993 ident: S1471068406002924_ref23 – volume-title: Functional logic programming with distributed constraint solving year: 2000 ident: S1471068406002924_ref42 – ident: S1471068406002924_ref29 doi: 10.1016/0743-1066(94)90034-5 – start-page: 682 volume-title: International Conference on Fifth Generation Computer Systems (FGCS'92) year: 1992 ident: S1471068406002924_ref12 – volume: 14 year: 2001 ident: S1471068406002924_ref7 article-title: FaCiLe: a functional constraint library publication-title: ALP Newsletter – ident: S1471068406002924_ref15 doi: 10.1007/11559306_10 – ident: S1471068406002924_ref4 doi: 10.1007/10720084_12 – volume-title: Constraint satisfaction in logic programming year: 1989 ident: S1471068406002924_ref53 – start-page: 23 volume-title: 3rd International Mathematical Symposium (IMS'99) year: 1999 ident: S1471068406002924_ref43 – start-page: 213 volume-title: 3rd International Conference on Algebraic and Logic Programming (ALP'92) year: 1992 ident: S1471068406002924_ref36 – start-page: 290 volume-title: 8th European Conference on Artificial Intelligence (ECAI'88) year: 1988 ident: S1471068406002924_ref17 – start-page: 1 volume-title: Proceedings of the 13th International Workshop on Logic Programming Environments year: 2003 ident: S1471068406002924_ref57 – ident: S1471068406002924_ref32 doi: 10.1016/0004-3702(80)90051-X – start-page: 184 volume-title: 5th International Symposium on Programming Language Implementation and Logic Programming PLILP'93 year: 1993 ident: S1471068406002924_ref35 doi: 10.1007/3-540-57186-8_79 – volume-title: Joint Conference on Declarative Programming (APPIA-GULP-PRODE'96) year: 1996 ident: S1471068406002924_ref6 – volume-title: The OPL optimization programming language year: 1999 ident: S1471068406002924_ref54 – volume-title: Constraint Processing year: 2003 ident: S1471068406002924_ref13 – ident: S1471068406002924_ref25 – ident: S1471068406002924_ref2 doi: 10.1007/BFb0013825 – ident: S1471068406002924_ref39 doi: 10.1007/3-540-48685-2_19 – ident: S1471068406002924_ref3 doi: 10.1145/347476.347484 – ident: S1471068406002924_ref5 doi: 10.1017/CBO9780511615320 – ident: S1471068406002924_ref49 doi: 10.1109/18.50388 – ident: S1471068406002924_ref55 doi: 10.1017/S1471068403001741 – volume-title: Programming Language Implementation and Logic Programming, 3rd International Symposium, PLILP'91, Passau, Germany, August 26–28, 1991, Proceedings year: 1991 ident: S1471068406002924_ref41 doi: 10.1007/3-540-54444-5 |
| SSID | ssj0016324 |
| Score | 1.8284892 |
| Snippet | In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming... In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains ( CFLP ( $\fd$ )) with a lazy functional logic... Abstract In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP ( $\fd$ )) with a lazy functional logic... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 537 |
| SubjectTerms | Regular Papers |
| Title | Constraint functional logic programming over finite domains |
| URI | https://www.cambridge.org/core/product/identifier/S1471068406002924/type/journal_article https://www.proquest.com/docview/201699480 https://www.proquest.com/docview/33122092 |
| Volume | 7 |
| WOSCitedRecordID | wos000250062600002&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 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/eLvHCXMwpV1LS8QwEB7U9eDFt7g-1hw8iYE2SR_Bg6gogrAsorB4Kds8QHB31a7-fjNp2kWEvXjpIe1Amnkm82UG4NQaFwYImdNUqIiKpMzpyPKIMiszX9FOlMI3m8j6_Xw4lIOAzakCrLKxid5Q66nCM3K3SY9TKUUeXb5_UGwahcnV0EFjGToxYzGK-UNG2yQCViL3l4syBPfkoklqYsVoHMSxyOel8L77vLTCbxf120J7t3O38c8Jb8J6iDfJVS0gW7BkJtuw0fRyIEG1d-ACO3f6fhEzgr6uPiIk3jKSAOIaOzdHEPJJ7CuGqkRPx46g2oXnu9unm3saGitQxUU2o4wro7R0kQsT2gUQXLDIlqnmudug6JK7PR9XqoxtInXKZOrYzE3iNJtZrWwZ8z1YmUwnZh9IKjOplLZO9Y0oR4nMzSjLNReJslayqAvn7boWQT2qooaWZcUfNnQhapa-UKFIOf772yKSs5bkva7Qsejjw4ZZ89m0nOrCSfvWaRmmTkYTM_2qCs6dgEWSHSykP4S1-ugXIWhHsDL7_DLHsKq-Z6_VZw8617f9wWPPC6l7DpKXH32A6RI |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6FgEQvDa-KECB7gAvCkrO7fqxQVSGgSpQQ5VCkiouJ9yFVokkaJ1T9Uf2PzKwfUYWUWw9cbY_l9Ty-mZ3ZGYB3zqIbIFUaxFKHgYzyNJg7EQbcqcR3tJO59MMmkuk0PT9Xsxbc1mdhqKyytoneUJulpj1yDNIHsVIyDU9WVwENjaLkaj1Bo5SKsb25xoitOB59Rfa-5_z029mXYVANFQi0kMkm4EJbbRSiNpcGwVNIHro8NiJF59zkAuMdoXU-cJEyMVcxLlHYCKWaO6NdPhD43gfwUEqMlVB9ZtHPJmlBnc_9YaaEiolSWSdRqUM1XaRroc-D0fn6XSuHu5B4FxE8zJ12_rMf9AQOK3-afS4V4Cm07OIZdOpZFawyXc_hE00m9fMwNoywvNwCZd7ys6pI7RJhnFFJK3MX5Iozs7xEguIF_LiXJRxBe7Fc2JfAYpUorY1D02ZlPo9UaudJaoSMtHOKh1342PAxq9S_yMrSuST7h-1dCGtWZ7pqwk5r_72P5ENDsio7kOx7uFcLx-5rGsnoQr-5i1aEUkPzhV1ui0yIAeeh4q_20vfh8fDs-ySbjKbjHhyU29xUbvca2pv11r6BR_rP5qJYv_WKweDXfQvaX0WNQ3M |
| 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=Constraint+functional+logic+programming+over+finite+domains&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FERN%C3%81NDEZ%2C+ANTONIO+J&rft.au=HORTAL%C3%81-GONZ%C3%81LEZ%2C+TERESA&rft.au=S%C3%81ENZ-P%C3%89REZ%2C+FERNANDO&rft.au=DEL+VADO-V%C3%8DRSEDA%2C+RAFAEL&rft.date=2007-09-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=7&rft.issue=5&rft.spage=537&rft_id=info:doi/10.1017%2FS1471068406002924&rft.externalDocID=1453618811 |
| 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 |