LMNtal as a hierarchical logic programming language
LMNtal (pronounced “ elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR),...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 410; číslo 46; s. 4784 - 4800 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2009
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| 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 | LMNtal (pronounced “
elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language. |
|---|---|
| AbstractList | LMNtal (pronounced ''elemental'') is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language. LMNtal (pronounced “ elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language. |
| Author | Ueda, Kazunori |
| Author_xml | – sequence: 1 givenname: Kazunori surname: Ueda fullname: Ueda, Kazunori email: ueda@ueda.info.waseda.ac.jp organization: Department of Computer Science and Engineering, Waseda University, 3-4-1, Okubo, Shinjuku-ku, Tokyo 169-8555, Japan |
| BookMark | eNp9kD1PwzAQhi1UJNrCD2DLxJZgx04ciwlVfEkFFpitq3NOXaVJsV0k_j2uysTQW046vc_p7pmRyTAOSMg1owWjrL7dFNGEoqRUFVQWVPAzMmWNVHlZKjEhU8qpyLmS1QWZhbChqSpZTwlfvr5F6DMIGWRrhx68WTuTJv3YOZPt_Nh52G7d0GU9DN0eOrwk5xb6gFd_fU4-Hx8-Fs_58v3pZXG_zA1XIuZARSkkMrAMBC8Fk8rWrVm1HGVbcTB21UjkWAkFogWuLLRKNAIYwMpa4HNyc9ybjvjaY4h664LBPt2B4z5oLhpZ1VKkIDsGjR9D8Gj1zrst-B_NqD7o0Rud9OiDHk2lTnoSI_8xxkWIbhyiB9efJO-OJKbfv5MyHYzDwWDrPJqo29GdoH8BW0WCKA |
| CitedBy_id | crossref_primary_10_1007_s13218_011_0162_3 crossref_primary_10_1109_ACCESS_2022_3217913 crossref_primary_10_1587_transinf_2017EDP7257 crossref_primary_10_1007_s10844_015_0357_4 crossref_primary_10_1016_j_scico_2017_06_002 |
| Cites_doi | 10.1145/2363.2433 10.1145/151233.151242 10.1016/j.entcs.2008.04.012 10.1006/inco.2000.3002 10.1006/jcss.1999.1693 10.1007/BF03037173 10.1016/S0743-1066(98)10005-5 |
| ContentType | Journal Article |
| Copyright | 2009 Elsevier B.V. |
| Copyright_xml | – notice: 2009 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2009.07.043 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 4800 |
| ExternalDocumentID | 10_1016_j_tcs_2009_07_043 S0304397509005325 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ XJT YNT ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c394t-a04247e1af1a4324179f6dcbd3e7d53acfb87e3e549a4da39fad9484a1aabffa3 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271250100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Thu Oct 02 09:45:51 EDT 2025 Sat Nov 29 05:15:01 EST 2025 Tue Nov 18 22:33:31 EST 2025 Fri Feb 23 02:16:40 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 46 |
| Keywords | LMNtal Concurrent constraint programming Concurrent logic programming Hierarchical graph rewriting |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c394t-a04247e1af1a4324179f6dcbd3e7d53acfb87e3e549a4da39fad9484a1aabffa3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2009.07.043 |
| PQID | 34875674 |
| PQPubID | 23500 |
| PageCount | 17 |
| ParticipantIDs | proquest_miscellaneous_34875674 crossref_primary_10_1016_j_tcs_2009_07_043 crossref_citationtrail_10_1016_j_tcs_2009_07_043 elsevier_sciencedirect_doi_10_1016_j_tcs_2009_07_043 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-11-01 |
| PublicationDateYYYYMMDD | 2009-11-01 |
| PublicationDate_xml | – month: 11 year: 2009 text: 2009-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2009 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Păun (b18) 2000; 61 Saraswat, Rinard (b19) 1990 Banâtre, Le Métayer (b2) 1993; 35 Gelernter (b10) 1985; 7 Ueda, Kato (b28) 2005; vol. 3365 Ueda (b22) 1996; vol. 1068 Ueda (b25) 2008; 209 Frühwirth (b8) 1998; 37 Milner (b17) 2001; vol. 2154 Miller (b16) 2004 Gardner, Wischik (b9) 2000; vol. 1892 Ueda (b26) 2008; vol. 5117 Lafont (b14) 1990 Ueda (b23) 1999 Ueda (b24) 2001; vol. 2215 Betz, Frühwirth (b3) 2005; vol. 3709 Andreoli, Pareschi (b1) 1991; 9 Schmitt, Stefani (b21) 2005; vol. 3267 Engels, Schürr (b6) 1995; 1 Fages, Ruet, Soliman (b7) 2001; 165 N. Kato, K. Mizuno, K. Ueda, Design of the operational semantics of the language model LMNtal, in: Proc. 21st Conference of Japan Society of Software Science and Technology, JSSST, 2004, pp. 159–163 (in Japanese) Inui, Kudo, Hara, Mizuno, Kato, Ueda (b12) 2008; 25 K. Ueda, N. Kato, Programming with logical links: Design of the LMNtal language, in: Proc. Third Asian Workshop on Programming Languages and Systems, APLAS 2002, 2002, pp. 115–126 Berry, Boudol (b4) 1990 Hodas, Watkins, Tamura, Kang (b11) 1998 Saraswat, Kahn, Levy (b20) 1990 Cardelli, Gordon (b5) 1998; vol. 1378 Maher (b15) 1987 Milner (10.1016/j.tcs.2009.07.043_b17) 2001; vol. 2154 Betz (10.1016/j.tcs.2009.07.043_b3) 2005; vol. 3709 Saraswat (10.1016/j.tcs.2009.07.043_b20) 1990 Inui (10.1016/j.tcs.2009.07.043_b12) 2008; 25 Păun (10.1016/j.tcs.2009.07.043_b18) 2000; 61 Berry (10.1016/j.tcs.2009.07.043_b4) 1990 10.1016/j.tcs.2009.07.043_b27 Schmitt (10.1016/j.tcs.2009.07.043_b21) 2005; vol. 3267 Ueda (10.1016/j.tcs.2009.07.043_b22) 1996; vol. 1068 Saraswat (10.1016/j.tcs.2009.07.043_b19) 1990 Andreoli (10.1016/j.tcs.2009.07.043_b1) 1991; 9 Engels (10.1016/j.tcs.2009.07.043_b6) 1995; 1 Banâtre (10.1016/j.tcs.2009.07.043_b2) 1993; 35 Frühwirth (10.1016/j.tcs.2009.07.043_b8) 1998; 37 10.1016/j.tcs.2009.07.043_b13 Cardelli (10.1016/j.tcs.2009.07.043_b5) 1998; vol. 1378 Gardner (10.1016/j.tcs.2009.07.043_b9) 2000; vol. 1892 Fages (10.1016/j.tcs.2009.07.043_b7) 2001; 165 Miller (10.1016/j.tcs.2009.07.043_b16) 2004 Ueda (10.1016/j.tcs.2009.07.043_b26) 2008; vol. 5117 Hodas (10.1016/j.tcs.2009.07.043_b11) 1998 Gelernter (10.1016/j.tcs.2009.07.043_b10) 1985; 7 Ueda (10.1016/j.tcs.2009.07.043_b23) 1999 Ueda (10.1016/j.tcs.2009.07.043_b25) 2008; 209 Ueda (10.1016/j.tcs.2009.07.043_b24) 2001; vol. 2215 Maher (10.1016/j.tcs.2009.07.043_b15) 1987 Lafont (10.1016/j.tcs.2009.07.043_b14) 1990 Ueda (10.1016/j.tcs.2009.07.043_b28) 2005; vol. 3365 |
| References_xml | – volume: 209 start-page: 187 year: 2008 end-page: 200 ident: b25 article-title: Encoding distributed process calculi into LMNtal publication-title: Electron. Notes Theor. Comput. Sci. – volume: 61 start-page: 108 year: 2000 end-page: 143 ident: b18 article-title: Computing with membranes publication-title: J. Comput. System Sci. – start-page: 53 year: 1999 end-page: 71 ident: b23 article-title: Concurrent logic/constraint programming: The next 10 years publication-title: The Logic Programming Paradigm: A 25-Year Perspective – volume: 9 start-page: 445 year: 1991 end-page: 473 ident: b1 article-title: Linear Objects: Logical processes with built-in inheritance publication-title: New Generation Comput. – start-page: 232 year: 1990 end-page: 245 ident: b19 article-title: Concurrent constraint programming (extended abstract) publication-title: Conf. Record of the Seventeenth Annual ACM Symp. on Principles of Programming Languages – volume: 7 start-page: 80 year: 1985 end-page: 112 ident: b10 article-title: Generative communication in Linda publication-title: ACM Trans. Prog. Lang. Syst. – volume: vol. 1892 start-page: 373 year: 2000 end-page: 382 ident: b9 article-title: Explicit fusions publication-title: Proc. 25th Int. Symp. on Mathematical Foundations of Computer Science – volume: vol. 5117 start-page: 392 year: 2008 end-page: 408 ident: b26 article-title: Encoding the pure lambda calculus into hierarchical graph rewriting publication-title: Proc. 19th Int. Conf. on Rewriting Techniques and Applications – start-page: 858 year: 1987 end-page: 876 ident: b15 article-title: Logic semantics for a class of committed-choice programs publication-title: Proc. Fourth Int. Conf. on Logic Programming – volume: 1 start-page: 75 year: 1995 end-page: 84 ident: b6 article-title: Encapsulated hierarchical graphs, graph types, and meta types publication-title: Electron. Notes Theor. Comput. Sci. – volume: vol. 3267 start-page: 146 year: 2005 end-page: 178 ident: b21 article-title: The Kell calculus: A family of higher-order distributed process calculi publication-title: Proc. Int. Workshop on Global Computing – volume: 37 start-page: 95 year: 1998 end-page: 138 ident: b8 article-title: Theory and practice of Constraint Handling Rules publication-title: J. Logic Program. – volume: 25 start-page: 124 year: 2008 end-page: 150 ident: b12 article-title: LMNtal: The Unifying programming language based on hierarchical graph rewriting publication-title: Computer Software – volume: vol. 1068 start-page: 134 year: 1996 end-page: 153 ident: b22 article-title: Experiences with strong moding in concurrent logic/constraint programming publication-title: Proc. Int. Workshop on Parallel Symbolic Languages and Systems – volume: 165 start-page: 14 year: 2001 end-page: 41 ident: b7 article-title: Linear concurrent constraint programming: Operational and phase semantics publication-title: Inform. and Comput. – start-page: 119 year: 2004 end-page: 150 ident: b16 article-title: Overview of linear logic programming publication-title: Linear Logic in Computer Science – volume: vol. 2215 start-page: 95 year: 2001 end-page: 126 ident: b24 article-title: Resource-passing concurrent programming publication-title: Proc. Fourth Int. Symp. on Theoretical Aspects of Computer Software – volume: vol. 1378 start-page: 140 year: 1998 end-page: 155 ident: b5 article-title: Mobile Ambients publication-title: Proc. First Int. Conf. on Foundations of Software Science and Computational Structures – reference: N. Kato, K. Mizuno, K. Ueda, Design of the operational semantics of the language model LMNtal, in: Proc. 21st Conference of Japan Society of Software Science and Technology, JSSST, 2004, pp. 159–163 (in Japanese) – volume: 35 start-page: 98 year: 1993 end-page: 111 ident: b2 article-title: Programming by multiset transformation publication-title: Commun. ACM – volume: vol. 2154 start-page: 16 year: 2001 end-page: 35 ident: b17 article-title: Bigraphical Reactive Systems publication-title: Proc. 12th Int. Conf. on Concurrency Theory – start-page: 145 year: 1998 end-page: 159 ident: b11 article-title: Efficient implementation of a linear logic programming language publication-title: Proc. 1998 Joint Int. Conf. and Symp. on Logic Programming – start-page: 81 year: 1990 end-page: 94 ident: b4 article-title: The Chemical Abstract Machine publication-title: Conf. Record of the Seventeenth Annual ACM Symp. on Principles of Programming Languages – start-page: 95 year: 1990 end-page: 108 ident: b14 article-title: Interaction Nets publication-title: Conf. Record of the Seventeenth Annual ACM Symp. on Principles of Programming Languages – reference: K. Ueda, N. Kato, Programming with logical links: Design of the LMNtal language, in: Proc. Third Asian Workshop on Programming Languages and Systems, APLAS 2002, 2002, pp. 115–126 – volume: vol. 3365 start-page: 110 year: 2005 end-page: 125 ident: b28 article-title: LMNtal: A language model with links and membranes publication-title: Proc. Fifth Int. Workshop on Membrane Computing – start-page: 431 year: 1990 end-page: 446 ident: b20 article-title: Janus: A step towards distributed constraint programming publication-title: Proc. 1990 North American Conf. on Logic Programming – volume: vol. 3709 start-page: 137 year: 2005 end-page: 151 ident: b3 article-title: A linear-logic semantics for Constraint Handling Rules publication-title: Proc. 11th Int. Conf. on Principles and Practice of Constraint Programming – volume: vol. 3709 start-page: 137 year: 2005 ident: 10.1016/j.tcs.2009.07.043_b3 article-title: A linear-logic semantics for Constraint Handling Rules – volume: 7 start-page: 80 year: 1985 ident: 10.1016/j.tcs.2009.07.043_b10 article-title: Generative communication in Linda publication-title: ACM Trans. Prog. Lang. Syst. doi: 10.1145/2363.2433 – ident: 10.1016/j.tcs.2009.07.043_b13 – volume: vol. 2154 start-page: 16 year: 2001 ident: 10.1016/j.tcs.2009.07.043_b17 article-title: Bigraphical Reactive Systems – volume: 35 start-page: 98 year: 1993 ident: 10.1016/j.tcs.2009.07.043_b2 article-title: Programming by multiset transformation publication-title: Commun. ACM doi: 10.1145/151233.151242 – start-page: 232 year: 1990 ident: 10.1016/j.tcs.2009.07.043_b19 article-title: Concurrent constraint programming (extended abstract) – volume: vol. 3267 start-page: 146 year: 2005 ident: 10.1016/j.tcs.2009.07.043_b21 article-title: The Kell calculus: A family of higher-order distributed process calculi – start-page: 145 year: 1998 ident: 10.1016/j.tcs.2009.07.043_b11 article-title: Efficient implementation of a linear logic programming language – volume: 209 start-page: 187 year: 2008 ident: 10.1016/j.tcs.2009.07.043_b25 article-title: Encoding distributed process calculi into LMNtal publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2008.04.012 – ident: 10.1016/j.tcs.2009.07.043_b27 – volume: 1 start-page: 75 year: 1995 ident: 10.1016/j.tcs.2009.07.043_b6 article-title: Encapsulated hierarchical graphs, graph types, and meta types publication-title: Electron. Notes Theor. Comput. Sci. – start-page: 119 year: 2004 ident: 10.1016/j.tcs.2009.07.043_b16 article-title: Overview of linear logic programming – volume: vol. 1068 start-page: 134 year: 1996 ident: 10.1016/j.tcs.2009.07.043_b22 article-title: Experiences with strong moding in concurrent logic/constraint programming – volume: vol. 3365 start-page: 110 year: 2005 ident: 10.1016/j.tcs.2009.07.043_b28 article-title: LMNtal: A language model with links and membranes – volume: 165 start-page: 14 year: 2001 ident: 10.1016/j.tcs.2009.07.043_b7 article-title: Linear concurrent constraint programming: Operational and phase semantics publication-title: Inform. and Comput. doi: 10.1006/inco.2000.3002 – start-page: 81 year: 1990 ident: 10.1016/j.tcs.2009.07.043_b4 article-title: The Chemical Abstract Machine – volume: 61 start-page: 108 year: 2000 ident: 10.1016/j.tcs.2009.07.043_b18 article-title: Computing with membranes publication-title: J. Comput. System Sci. doi: 10.1006/jcss.1999.1693 – volume: vol. 2215 start-page: 95 year: 2001 ident: 10.1016/j.tcs.2009.07.043_b24 article-title: Resource-passing concurrent programming – start-page: 95 year: 1990 ident: 10.1016/j.tcs.2009.07.043_b14 article-title: Interaction Nets – volume: vol. 5117 start-page: 392 year: 2008 ident: 10.1016/j.tcs.2009.07.043_b26 article-title: Encoding the pure lambda calculus into hierarchical graph rewriting – volume: 9 start-page: 445 year: 1991 ident: 10.1016/j.tcs.2009.07.043_b1 article-title: Linear Objects: Logical processes with built-in inheritance publication-title: New Generation Comput. doi: 10.1007/BF03037173 – start-page: 53 year: 1999 ident: 10.1016/j.tcs.2009.07.043_b23 article-title: Concurrent logic/constraint programming: The next 10 years – volume: 37 start-page: 95 year: 1998 ident: 10.1016/j.tcs.2009.07.043_b8 article-title: Theory and practice of Constraint Handling Rules publication-title: J. Logic Program. doi: 10.1016/S0743-1066(98)10005-5 – volume: vol. 1892 start-page: 373 year: 2000 ident: 10.1016/j.tcs.2009.07.043_b9 article-title: Explicit fusions – volume: vol. 1378 start-page: 140 year: 1998 ident: 10.1016/j.tcs.2009.07.043_b5 article-title: Mobile Ambients – start-page: 858 year: 1987 ident: 10.1016/j.tcs.2009.07.043_b15 article-title: Logic semantics for a class of committed-choice programs – start-page: 431 year: 1990 ident: 10.1016/j.tcs.2009.07.043_b20 article-title: Janus: A step towards distributed constraint programming – volume: 25 start-page: 124 year: 2008 ident: 10.1016/j.tcs.2009.07.043_b12 article-title: LMNtal: The Unifying programming language based on hierarchical graph rewriting publication-title: Computer Software |
| SSID | ssj0000576 |
| Score | 2.0209098 |
| Snippet | LMNtal (pronounced “
elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and... LMNtal (pronounced ''elemental'') is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 4784 |
| SubjectTerms | Concurrent constraint programming Concurrent logic programming Hierarchical graph rewriting LMNtal |
| Title | LMNtal as a hierarchical logic programming language |
| URI | https://dx.doi.org/10.1016/j.tcs.2009.07.043 https://www.proquest.com/docview/34875674 |
| Volume | 410 |
| WOSCitedRecordID | wos000271250100012&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: PRVESC databaseName: ScienceDirect database customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLYYcNgODNimARvzgRNVUBq7OD4ixLShUe1QpN6sF_-QQFuKmnZC--v3HNtt6AQah12iKmosN5_7vWe_Hx8hRzkUGs1enplKsoyDlZl0lcgK6EupTYmTr1qxCTEcluOx_B4VsptWTkDUdXl_L-_-K9R4D8H2pbPPgHsxKN7Azwg6XhF2vP4T8N-uhr7AEZoe9LzQdRsq8Ei0LJcSsn76I4J0WNn1UEedykYdJR960U4mdK6tiZVkv-f1ZHrz4OhAxhq6JcMwHxaRQbok0SGPaaYBd95lNy6CnFu0lLxsm4z-zcLhQOD2ZKab2BFUnOShG9PDjtcrlmiRH5hSz24VDuGVMqXKhcIhXpCNQgwk0tfG2deL8eXS6A5ECEvHX5QC2G0q38o8HnNBVoxx62GMtslW3BrQswDpDlmz9S55nWQ3aGThXfLqatFqt3lDWMCbQkOBdvGmLd60gzdNeL8l158vRudfsqiEkWkm-SwDH6AWtg-uD76FIrKoOzW6MswKM2CgXVUKyyxu9oEbYNKBkbzk0AeonAP2jqzXk9q-J9RqoTV65XJQSO5sCZDrQljrjPG1o2aP5OnlKB3bxHu1kh_qUVD2yPHikbvQI-WpL_P0xlVcvMF5U7h6nnrsU0JHIQH6qBbUdjJvFPNb7lPB958ziwPycvmH-EDWZ9O5_Ug29a_ZTTM9jIvrDzdKfdM |
| linkProvider | Elsevier |
| 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=LMNtal+as+a+hierarchical+logic+programming+language&rft.jtitle=Theoretical+computer+science&rft.au=Ueda%2C+Kazunori&rft.date=2009-11-01&rft.issn=0304-3975&rft.volume=410&rft.issue=46&rft.spage=4784&rft.epage=4800&rft_id=info:doi/10.1016%2Fj.tcs.2009.07.043&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2009_07_043 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |