Авторизация
Поиск по указателям
Clocksin W.F., Mellish C.S. — Programming in Prolog, using the ISO standard
Обсудите книгу на научном форуме
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Programming in Prolog, using the ISO standard
Авторы: Clocksin W.F., Mellish C.S.
Аннотация: Originally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be a basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete.
Язык:
Рубрика: Computer science /
Статус предметного указателя: Готов указатель с номерами страниц
ed2k: ed2k stats
Издание: 5-th edition
Год издания: 2003
Количество страниц: 314
Добавлена в каталог: 30.04.2014
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
! 80 132
' 37 140
* 37 140
+ 37 139
, 134
--> 222
/ 37 140
/*...*/ 20
; 134
< 34 141
= 32 136 140
=.. 130
=< 34 141
== 137
> 34 141
>= 34 141
Accumulator 67 157
Ancestor 205
Anonymous variable 27
APPEND 63
arg 129
Argument 5
Arithmetic 34
asserta 126
assertz 126
Associativity 31 116
atom 123
atomic 123
atom_chars 131
Backtracking 13 38 73
body 17
Boundary condition 54
box model 194
break 209
Bug 187
Built-in predicate 119
CALL 194
Catchall 59
Cervoni, L. 278
CHARACTER 25 29
Circular definition 55
Clausal form 240
Clause 20 37 244
Clocksin, W.F. ii
CLOSE 113 139
Co-refer 20 33 44
Colmerauer, A. 237
comment 20
Comparison 34 60
Component 28
Compound term 27 238
Conjunction 10 11
Conjunctive normal form 243
Connective 239
Constant 26
Constant symbol 238
consult 115 120 183
creep 206
Current input stream 112
Current output stream 112
current_input 114 139
current_output 114 139
Cut 80
Cut-fail 90
Database 6
Debugging 187
Deransart, P. 278
Derivative 177
Design decision 187
diff 24
Difference list 70
Difference structure 70
digit 25
Disjunction 134 151
Display 103
Dynamic predicates 125
Ed-Dbali, A. 278
Edinburgh Prolog ii
Element 50
Empty clause 250
Empty list 50
End of file 111
end_of_file 112
equal 32
Erastothenes, sieve of 175
Evaluate 37
exit 194
exponentiation 178
Fact 3 4
fail 194
FILE 111
Filename 111
findAll 167
functor 28
FX 116
fy 116
Generator 93 161
GENSYM 165
get_char 105 137
Goal 10
grammar rules 213
Greatest common divisor 176
Hanoi, Towers of 152
Head of list 50
Head of rule 17
Hoare, C.A.R. 163
Hogger, C. 255
hole 51
Horn clause 251
Identical 137
Implementations of Prolog 277
Infix 30
Input 100
Instantiate 8
Interpreter 183
IS 36 139
islist 56
ISO i
Knuth, D. 164
Kowalski, R. 23 255
leap 207
Leashing 201
Left associative 31 117
Left recursion 56
Length 67
Lisp 50
LIST 50
LISt Processing 155
listing 125
Literal 241
Logic programming 255
Mapping 57 179
Member 54
MOD 37 140
Negation 135
Nilsson, N. 174
nl 138
NO 3 6
nodebug 143
Non-printing character 100
Non-printing characters 29
nonvar 123
Norvig, P. 174
nospy 143 201
notrace 143 201
Noughts-and-crosses 93
NUMBER 26
number_chars 131
Object 2
Object-Oriented Programming 2
Occurs check 254
op 117 138
open 138
Operator 30
OR 134
Output 100
Parent goal 84
Parsing 213
phrase 223
Place-marker 9
Portability 277
POSITION 30 116
Postfix 31
Precedence 31 116
Predicate 5
Prefix 31
Pretty print 102
Prime number 175
Procedure 188
PROLOG 1 237
Public predicates 124
put_char 138
Pythagorean triple 176
Quantifier 239
Question 3 6
Quicksort 163
Random 164
Re-satisfy 38
READ 100 137
Reading 100
Reading characters 105
Reading files 112
Reading sentences 108
Recursion 47
Redo 194
Relationship 2
REPEAT 132
Resolution 248
retract 126 183
retractall 183
Right associative 31 117
Robinson, J.A. 248
Rule 3 16
Russell, S. 174
Satisfy 37
Scope 18
Searching graphs 169
Searching maze 148
Searching, best first 173
Searching, breadth first 172
Searching, database 9 73
Searching, depth first 170
Searching, recursive 53
Set-processing 159
setof 167
set_input 114 139
set_output 114 139
SHARE 20 33 44 49
simplification 180
Single-quote 26
skip 206
Skolem constant 242
Sorting tree 145
Sorting, bubble 162
Sorting, insertion 162
Sorting, naive 161
Sorting, Quicksort 163
spy 143 201
Spy point 200
Structure 27 47
Syntax 25
Syntax error 191
tail 50
Term 2
Term in Predicate Calculus 237
Term in Prolog 25
tester 93 161
Theorem-proving 248
Tic-Tac-Toe 93
Trace 143 194 201
Tracing 194 200
TREE 47
TRUE 121
Unification 249
unify 6 32 43
Unify_with_occurs_check 254
Uninstantiated 8
univ 130
User 120
user_input 112
user_output 112
var 122
Variable 8 27
Variable symbol 238
Vine diagram 51
Winston, P. 174
WRITE 138
write_canonical 103 138
Writing 100
Writing characters 106
Writing files 113
xf 116
xfx 116
xfy 116
Yes 3 6
yf 116
yfx 116
yfy 116
[...] 51 115 222
\+ 135
^ 178
{...} 227
Реклама