Last update: Sun Oct 15 02:39:02 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Maeder:1994:MPLa,
author = "Roman E. Maeder",
title = "The {Mathematica} Programmer: Logic Programming {I}:
The Interpreter",
journal = j-MATHEMATICA-J,
volume = "4",
number = "1",
pages = "53--63",
month = "Winter",
year = "1994",
CODEN = "????",
ISSN = "1047-5974 (print), 1097-1610 (electronic)",
ISSN-L = "1047-5974",
bibdate = "Sat Nov 6 13:33:52 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/mathematica.bib;
http://www.math.utah.edu/pub/tex/bib/mathematicaj.bib;
http://www.mathematica-journal.com/issue/v4i1/",
URL = "http://www.mathematica-journal.com/issue/v4i1/columns/maeder/53-63_Roman41.mj.pdf;
http://www.mathematica-journal.com/issue/v4i1/columns/maeder/index.html",
abstract = "This is the first of two columns on logic programming.
It gives an introduction to the subject and develops a
query evaluator in Mathematica. This query evaluator is
an interpreter for a subset of the programming language
Prolog. A prerequisite for it is unification, which is
a generalization of the pattern matching that underlies
Mathematica's own evaluator.",
acknowledgement = ack-ble # " and " # ack-nhfb,
journal-URL = "http://www.mathematica-journal.com/",
}
Related entries
- column,
4(1)64,
4(1)70,
4(1)74,
4(2)38,
4(2)54,
6(2)52,
6(3)58
- develop,
3(4)66,
4(1)64,
4(1)74,
4(1)81,
6(2)41,
14(z)z-9
- evaluator,
4(2)38
- first,
2(3)z-4,
4(2)38,
5(4)17,
6(2)41,
11(2)284,
13(z)z-3,
13(z)z-4,
14(z)z,
14(z)z-1,
14(z)z-7
- generalization,
16(z)z-1,
16(z)z-6
- give,
4(1)9,
11(2)284,
14(z)z-5,
14(z)z-6
- introduction,
4(1)z-4,
5(4)17,
6(2)60,
8(2)z-5,
10(2)z-1,
12(1)4,
13(z)z,
14(z)z-4,
15(z)z-8
- language,
6(2)32,
6(2)66,
15(z)z-8,
16(z)z,
16(z)z-1
- logic,
1(1)85,
2(1)91,
2(1)z-4,
4(1)64,
4(2)38,
11(3)z-7
- Maeder, Roman E.,
1(2)30,
1(3)z-10,
1(4)z-6,
2(1)z-8,
2(2)z-6,
2(3)z-6,
2(4)z-6,
3(1)z-7,
3(2)z-7,
3(3)z-7,
3(4)z-6,
4(2)38,
4(3)z-6,
4(4)37,
5(1)z-8,
5(2)z-5,
5(3)z-7,
5(4)20,
5(4)z-8,
6(1)z-5,
6(2)32,
6(3)37,
6(4)z-7,
7(1)z-6
- matching,
4(1)38,
6(3)14,
7(3)z-4,
14(z)z-3
- own,
14(z)z-2
- pattern,
4(1)9,
4(1)38,
4(3)z-3,
6(3)14,
7(3)z-4,
13(z)z-7,
15(z)z-8
- Programmer,
1(2)30,
1(3)z-10,
1(4)z-6,
2(1)z-8,
2(2)z-6,
2(3)z-6,
2(4)z-6,
3(1)z-7,
3(2)z-7,
3(3)z-7,
3(4)z-6,
4(2)38,
4(3)z-6,
4(4)37,
5(1)z-8,
5(2)z-5,
5(3)z-7,
5(4)z-8,
6(1)z-5,
6(2)32,
6(3)37,
7(1)z-6,
7(4)z-6
- programming,
1(3)z-8,
2(1)88,
2(1)88-1,
2(1)z-8,
3(1)z-7,
3(2)z-6,
4(1)44,
4(2)38,
4(2)44,
4(4)z-2,
5(1)z-2,
5(1)z-4,
5(1)z-5,
5(3)44,
5(4)17,
5(4)z-9,
6(1)z-8,
6(2)41,
6(3)28,
6(3)44,
6(4)z-7,
6(4)z-9,
7(1)z-8,
7(3)z-1,
9(2)z-4,
14(z)z-2,
15(z)z-8,
16(z)z
- Prolog,
6(3)z
- query,
4(2)38
- subject,
12(1)3,
13(z)z-1,
14(z)z-8
- two,
2(3)z-4,
4(2)38,
4(2)83,
5(4)8,
7(4)z-6,
12(1)4,
13(z)z-3,
13(z)z-5,
13(z)z-7,
13(z)z-9,
14(z)z,
15(z)z,
16(z)z,
16(z)z-3
- which,
2(3)z-4,
4(1)9,
4(2)10,
4(2)44,
5(4)17,
6(2)41,
6(2)66,
12(1)1,
12(1)2,
13(z)z-3,
13(z)z-6,
14(z)z,
14(z)z-3,
14(z)z-4,
15(z)z,
15(z)z-5,
15(z)z-8,
16(z)z,
16(z)z-5