- List of Backups
- View the diff.
- View the source.
- View the backup.
- Go to Example Programs.
- 1 (2004-01-30 (Fri) 14:00:03)
- 2 (2004-04-06 (Tue) 10:31:10)
- 3 (2004-06-11 (Fri) 10:47:20)
- 4 (2004-07-12 (Mon) 08:16:01)
- 5 (2004-10-15 (Fri) 11:20:52)
- 6 (2004-11-30 (Tue) 11:33:52)
- 7 (2006-03-24 (Fri) 14:57:22)
- 8 (2006-11-02 (Thu) 15:17:55)
- 9 (2006-11-02 (Thu) 15:17:55)
- 10 (2010-05-17 (Mon) 05:35:40)
- 11 (2010-05-20 (Thu) 02:49:45)
- 12 (2010-05-28 (Fri) 14:18:44)
- 13 (2010-06-10 (Thu) 05:31:16)
*14 (2010-06-14 (Mon) 02:30:54)*- 15 (2012-05-10 (Thu) 07:27:23)
- 16 (2012-05-10 (Thu) 07:27:23)
- 17 (2014-06-01 (Sun) 14:39:51)
- 18 (2015-05-20 (Wed) 22:08:17)

- The added line is THIS COLOR.
- The deleted line is THIS COLOR.

//[[Documentation]] *Example Programs A number of example programs, including -those with just one or a few rules, -encodings of various calculi (propositional logic, Petri Nets, lambda calculus, ambient calculus, etc.), -state-space search using SLIM's nondeterministic execution (typical AI problems etc.), -model checking (distributed and concurrent algorithms, protocol verification, etc.), -graph visualization using UNYO-UNYO (fullerenes (C60) etc.), -those using LMNtal Java's GUI, and so on, can be found in [[''this directory'' (click here)>http://www.ueda.info.waseda.ac.jp/lmntal/demo/]]. -The 'ltl' subdirectory contains both programs and LTL formulas to model-check them. -The 'unyo' subdirectory contains programs to be run under the UNYO-UNYO visualizer. -The 'wt' subdirectory contains programs to be run with the LMNtal window toolkit of LMNtal Java. -The [[''ltl'' subdirectory>http://www.ueda.info.waseda.ac.jp/lmntal/demo/ltl/]] contains both programs and LTL formulas to model-check them. -The [[''unyo'' subdirectory>http://www.ueda.info.waseda.ac.jp/lmntal/demo/unyo/]] contains programs to be run under the UNYO-UNYO visualizer. //-The [[''wt'' subdirectory>http://www.ueda.info.waseda.ac.jp/lmntal/demo/wt/]] contains programs to be run with the LMNtal window toolkit of LMNtal Java. All these programs are included in the latest distribution of [[LaViT>http://www.ueda.info.waseda.ac.jp/lmntal/lavit/index.php?Download]]. Let us introduce some simple examples below. **List Concatenation Lists formed with c(cons) and n(il) constructors can be concatenated using the following two rules: append(X,Y,Z), n(X) :- Y=Z. append(X,Y,Z), c(A,X1,X) :- c(A,Z1,Z), append(X1,Y,Z1). Enter those rules with the following initial state: Let them rewrite the following initial state: append(c(1,c(2,c(3,n))),c(4,c(5,n)),result). RESULT: result(c(1,c(2,c(3,c(4,c(5,n)))))) with the two rules above. The above initial state is written using the '''term abbreviation scheme''' explained [[here>Syntax]]. By further applying the term abbreviation scheme and the Prolog-like list syntax, list concatenation can be written also as: The above initial state is written using the '''term abbreviation scheme''' explained [[here>Syntax]]. By using the term abbreviation scheme and the Prolog-like list syntax, the list concatenation program can be written also as: Z=append([], Y) :- Z=Y. Z=append([A|X1],Y) :- Z=[A|append(X1,Y)]. result = append([1,2,3],[4,5]). RESULT: result=[1,2,3,4,5] with the two rules above. **Self-Organizing Loops Ten agents with two free hands are going to hold hands with others. Ten agents, each with two free hands, are going to hold hands with others. Is it possible that some agent is left alone? a(free,free),a(free,free),a(free,free),a(free,free),a(free,free), a(free,free),a(free,free),a(free,free),a(free,free),a(free,free). a(free,free), a(free,free), a(free,free), a(free,free), a(free,free), a(free,free), a(free,free), a(free,free), a(free,free), a(free,free). a(X,free),a(free,Y) :- a(X,C),a(C,Y). RESULT: Twenty possible final configurations. You can randomly compute them by running the program using LMNtal Java with the ''-s'' (shuffle) option, or running SLIM with the ''-nd'' (nondeterministic execution) option. LaViT's ''StateViewer'' will show you a state transition diagram of the problem. RESULT: Twenty possible final configurations, which can be computed by running SLIM with the ''-nd'' (nondeterministic execution) option. LaViT's ''StateViewer'' will show you a state transition diagram of the problem. **Vending Machine Two customers with different amounts of coins and hunger are buying chocolates from a vending machine. Each chocolate costs three and only two kinds of coins are considered: one and five. {customer,a,five,one,one,hunger,hunger}. % Customer a has $7, buying 2 chocolates {customer,b,five,hunger}. % Customer b has $5, buying 1 chocolate {customer,a,five,one,one,hunger,hunger}. % Customer a has $7 and wants to buy two chocolates {customer,b,five,hunger}. % Customer b has $5 and wants to buy one chocolate {vending,choco,choco,choco,one,one}. % Vending machine has 3 chocolates {customer,$c,hunger,five}, {vending,$v,choco,one,one} :- {customer,$c,choco,one,one}, {vending,$v,five}. {customer,$c,hunger,one,one,one}, {vending,$v,choco} :- {customer,$c,choco}, {vending,$v,one,one,one}. LaViT with ''-nd'' will compute two possible final states: RESULT 1: {customer,a,choco,choco,one}, {customer,b,choco,one,one}, {vending,five,five,one}, <RULES> RESULT 2: {customer,a,hunger,hunger,five,one,one}, {customer,b,choco,one,one}, {vending,choco,choco,five}, <RULES> RESULT 1: {customer,a,choco,choco,one}, {customer,b,choco,one,one}, {vending,five,five,one}, <RULES> RESULT 2: {customer,a,hunger,hunger,five,one,one}, // Oops! {customer,b,choco,one,one}, {vending,choco,choco,five}, <RULES> Observe that applying each rule preserves the total amount of coins and chocos within the system. the total number of coins and chocolates within the system.