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:MPLb,
author = "Roman E. Maeder",
title = "The {Mathematica} Programmer: Logic Programming {II}:
Applications",
journal = j-MATHEMATICA-J,
volume = "4",
number = "2",
pages = "38--43",
month = "Spring",
year = "1994",
CODEN = "????",
ISSN = "1047-5974 (print), 1097-1610 (electronic)",
ISSN-L = "1047-5974",
bibdate = "Sat Nov 6 13:33:54 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/mathematicaj.bib;
http://www.mathematica-journal.com/issue/v4i2/",
URL = "http://www.mathematica-journal.com/issue/v4i2/columns/maeder/38-43_maeder42.mj.pdf;
http://www.mathematica-journal.com/issue/v4i2/columns/maeder/index.html",
abstract = "This is the second of two columns on logic
programming. It presents examples of typical logic
programming applications using the query evaluator
developed in the first column. Among the examples
considered are implementations of Prolog-style lists,
nondeterministic automata, backtracking and exhaustive
search, theorem proving, and deductive databases.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.mathematica-journal.com/",
}
Related entries
- application,
1(1)69,
1(2)70,
2(2)66,
2(2)66-1,
4(1)44,
4(1)64,
4(2)10,
6(3)10,
8(2)z-4,
9(4)z-11,
11(1)z,
11(2)284,
11(2)z-1,
12(1)2,
12(1)3,
15(z)z-6
- automata,
16(z)z-2
- column,
4(1)53,
4(1)64,
4(1)70,
4(1)74,
4(2)54,
6(2)52,
6(3)58
- database,
3(2)z-7,
9(2)z-13
- developed,
8(3)z-6,
15(z)z-7,
16(z)z-3
- evaluator,
4(1)53
- example,
3(3)z-6,
4(1)9,
4(1)44,
4(1)64,
4(2)44,
5(2)z-9,
6(2)66,
9(2)z-6,
11(2)172,
12(1)3,
12(1)4,
13(z)z-8,
14(z)z-4,
15(z)z-3,
16(z)z,
16(z)z-2,
16(z)z-4,
16(z)z-5
- first,
2(3)z-4,
4(1)53,
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
- implementation,
1(1)75,
4(4)37,
10(1)z-7,
10(3)z-5,
11(3)z-2,
12(1)1
- list,
4(1)28,
4(2)54,
6(3)14,
6(3)58
- logic,
1(1)85,
2(1)91,
2(1)z-4,
4(1)53,
4(1)64,
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(1)53,
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
- present,
4(1)70,
4(1)z-3,
4(2)44,
4(2)52,
4(2)54,
6(2)52,
6(2)60,
6(2)72,
6(3)58,
6(3)65,
6(3)73,
13(z)z-7,
15(z)z-4,
15(z)z-5,
15(z)z-7
- 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(1)53,
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(1)53,
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
- proving,
2(2)58,
8(2)z
- query,
4(1)53
- search,
10(3)z,
15(z)z-8
- second,
2(3)z-4,
5(4)17,
6(3)37,
9(2)z-10,
11(2)172,
13(z)z-1,
13(z)z-3,
14(z)z-2,
14(z)z-9
- theorem,
3(1)z-4,
13(z)z-2,
15(z)z-5,
15(z)z-6
- two,
2(3)z-4,
4(1)53,
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
- using,
1(2)45,
1(3)86,
2(2)58,
3(2)31,
3(4)66,
4(1)38,
4(1)64,
4(1)70,
4(1)81,
6(3)22,
6(3)44,
8(3)z-1,
8(3)z-6,
9(1)z,
9(4)686,
9(4)z-1,
10(1)z-4,
10(4)z-1,
11(2)172,
11(3)z-3,
13(z)z-1,
14(z)z,
14(z)z-1,
14(z)z-3,
15(z)z,
15(z)z-2,
15(z)z-5,
15(z)z-9,
16(z)z-2,
16(z)z-3,
16(z)z-5,
16(z)z-7