LMNtal as a hierarchical logic programming language

    Research output: Contribution to journalArticle

    9 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)4784-4800
    Number of pages17
    JournalTheoretical Computer Science
    Volume410
    Issue number46
    DOIs
    Publication statusPublished - 2009 Nov 1

    Fingerprint

    Linear Logic
    Logic programming
    Logic Programming
    Concurrency
    Computational Model
    Computer programming languages
    Programming Languages
    Graph Rewriting
    Concurrent Programming
    Constraint Handling
    Intuitionistic Logic
    Multiset
    Language Model
    Rewriting
    Concurrent
    Connectivity
    Membrane
    Substrate
    Model-based
    Membranes

    Keywords

    • Concurrent constraint programming
    • Concurrent logic programming
    • Hierarchical graph rewriting
    • LMNtal

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    LMNtal as a hierarchical logic programming language. / Ueda, Kazunori.

    In: Theoretical Computer Science, Vol. 410, No. 46, 01.11.2009, p. 4784-4800.

    Research output: Contribution to journalArticle

    @article{f4e4627f2a9440f9afb5a4f9e3ccd3d5,
    title = "LMNtal as a hierarchical logic programming language",
    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.",
    keywords = "Concurrent constraint programming, Concurrent logic programming, Hierarchical graph rewriting, LMNtal",
    author = "Kazunori Ueda",
    year = "2009",
    month = "11",
    day = "1",
    doi = "10.1016/j.tcs.2009.07.043",
    language = "English",
    volume = "410",
    pages = "4784--4800",
    journal = "Theoretical Computer Science",
    issn = "0304-3975",
    publisher = "Elsevier",
    number = "46",

    }

    TY - JOUR

    T1 - LMNtal as a hierarchical logic programming language

    AU - Ueda, Kazunori

    PY - 2009/11/1

    Y1 - 2009/11/1

    N2 - 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.

    AB - 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.

    KW - Concurrent constraint programming

    KW - Concurrent logic programming

    KW - Hierarchical graph rewriting

    KW - LMNtal

    UR - http://www.scopus.com/inward/record.url?scp=70349545894&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=70349545894&partnerID=8YFLogxK

    U2 - 10.1016/j.tcs.2009.07.043

    DO - 10.1016/j.tcs.2009.07.043

    M3 - Article

    AN - SCOPUS:70349545894

    VL - 410

    SP - 4784

    EP - 4800

    JO - Theoretical Computer Science

    JF - Theoretical Computer Science

    SN - 0304-3975

    IS - 46

    ER -