|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Gabbay D.M., Hogger C.J., Robinson J.A. — Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 5: Logic Programming |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
Equational logic, model of 28
Equational logic, programming in 28—31
Equational logic, rules of inference 75—78
Equational logic, soundness of proof systems 77
Equational Machine [EM] 138
Equational programming language 31—35
Error algebra 73
Eureka predicate 704 742
Eureka step 704
Evaluation see "Eager evaluation" "Lazy
Event calculus 245—246
Eventually outermost 99
Expert Systems 490
Explanation, formula 285
Explanation, most specific 267
Explicit negation 288 289
Extended logic program 289 295—297
Extended logic program with abduction 300
Extended logic program, inconsistency 291—293
Extended logic program, semantics 289—290
Extended logic programming [ELP] 288—300
Extended logic programming [ELP], argumentation-theoretic approach 297—299
Extended stable model semantics 297
Extension 256n
Extension in model elimination procedure 182
Extension, complete 264
Extension, preferred 263
Fact, in Prolog 433—434
Fair term rewriting sequence 98 99
Fault diagnosis, use of abduction 243
Felicitous model 401
FF see "Finite failure"
Filter promotion strategy 748
Financial planning 676
Finite differencing 753
Finite failure [FF] 367
Finite failure [FF], during program transformation 730—732
First-order N-Prolog 215
First-order predicate calculus [FOPC] 1—2 16 70
First-order predicate calculus [FOPC], models for 16—17
First-order predicate calculus [FOPC], programming in 15—21
First-order predicate calculus [FOPC], semantic system for 17
Fixed point semantics 609—611
Floundering 343 359—361 367 369 406
Floundering in SLDNF-resolution 364
Floundering, recursive undecidability of occurrence 369
Floundering, recursive unsolvability 360
Flying birds example 249 250—251 254—255 272 298 299—300 see "Ostrich"
FOL 441
Folding 717—718 721—723
Folding rule 701 709—711
Folding rule, partial correctness 701
FOPC see "First-order predicate calculus"
Forced folding 744
Formal derivability 6
Formula, logical 7
Forward chaining refutation 172
Forward-directed refutation 172
Four-valued logic 391
Fourier algorithm 643
Free variable 17
Functional algebra 58—60
Functional program as data 565—572
Functional program, approaches to compiling 137
Functional programming 560—561
Functional programming language 31—35 71
Functional programming language, design of 31—35
Functional programming language, deviations from pure LP in implementation 34
Functional programming language, higher-order 31—32
Functional programming language, notations 34
Functions, language representing 510—513
Futamura projection 487 488—489 771
Future redundancy 653—654
G machine 138
Galois connection 8
Garbage collection, generational 136
Gaussian elimination 630—631
GCWA see "Generalized closed world assumption"
GCWAS see "Generalized closed world assumption for stratified logic programs"
General-level N-Prolog 215
Generalization + equality 715
Generalization strategy 702 743 745 747
Generalized closed world assumption [GCWA] 338 394—395
Generalized closed world assumption [GCWA] for stratified logic programs 345
Generalized closed world assumption [GCWA], computational difficulty for negative queries 339
Generalized stable model 270
Generalized stable model, semantics 271
Generalized well-founded semantics [GWFS] 346—347
Generic model 372
Goal equivalence 712 713 714
Goal formulas 503
Goal replacement 718
Goal replacement rule 702 712—713 714
Goal-oriented refutation 172
Goedel numbering 45 441
Goedel T-predicate 40
Goedel [system] 424 442 453—459 461 473
Ground representation 423
Ground resolution 166
Ground resolution, completeness 167
Ground resolution, soundness 166—167
GWFS see "Generalized well-founded semantics"
Harrop formula 202—203 see
Harrop formula, higher-order, value of language 584
Hashed cons 116 119
Head-normal form 130
Herbrand base see "Disjunctive Herbrand base"
Herbrand domain 327
Herbrand model 58—60 327 see "Least "Minimal "Supported
Herbrand model, fixpoint characterization 378 379
Herbrand model, intersection property 328 331 332
Herbrand universe 174 see
Hereditary Harrop formula 203 574—584
Hereditary Harrop formula, language based on, novelty 576
Hierarchical program 361 391—393
High-level vision, use of abduction 243
Higher-order logic, various senses 501—502
Higher-order program, examples 552—556
Higher-order programming 500
Higher-order programming, syntax 549—552
Hilog 468
Horn characterization 330
Horn clause 21 22 186 326
Horn clause logic 186—190 229
Horn clause logic, procedural qualities 186
Horn clause program, definite 384—385
Horn clause, higher-order 501 523—528 572—574 584—586
Horn clause, implementation of interpreter 563—565
Horn clause, negative 502
Horn clause, positive 502 503
Horn formula 180
Horn set 180—181
Hypergraph 151—152
Hypergraph, rewriting, implementation 152
Hypothetical implication 213
Hypothetical reasoning, chemical 671—674
Hypothetical reasoning, use of meta-programming 473—477
IFF 358
implementation 489—490
Implication, in goals 547—577
Implicational computations, backtracking 47
Implicational computations, conjunctive 48
Implicational computations, naive 46
Implicational computations, naive, with failure 46
Implicational logic program 46
Implied iff 358
Increment ality of algorithms 628—630
Incremental normal form 143—144
Independence of negated constraints 607
INDEX 104 105
| Indexical constraints 625
Indexings, in recursion theory 45
Induction 236
Inference engine, in constraint programming 645—648
Inferential proof, in equational logic 74 75
Infinite Terms 141—147
Information system 607—608
InH-Prolog 221—229 230
InH-Prolog, examples of deductions 224—227
InH-Prolog, representation of inference system 227—228
Initial algebra 58—60
instance of 29
Institution 8
integrity check 274
Integrity checking 242—243
Integrity checking, optimisation 275—277
Integrity constraints 241—243 251
Integrity constraints in logic programming 309—310
Integrity constraints, role in providing attacks 308
Interpreter for higher-order formulae 546—549
Interpreter, design problems 209—212
Intuitionistic logic 196 206
Iterative deepening 175
JTMS see "Justification-based truth maintenance system"
Justification, in truth maintenance 303—304
Justification-based truth maintenance system [JTMS] 304—305
KA see "Knowledge assimilation"
KB see "Knowledge base"
KM-admissible 278 298
Knowledge assimilation [KA] 244—249 309 471—473
Knowledge assimilation [KA], use of abduction 243
Knowledge base [KB] 244
Knowledge based systems 490
Knowledge, communication 10
Knowledge, explicit 10 42
Knowledge, implicit 10 42
Knowledge, representations of 10
Knuth — Bendix methods 92—96
Lambda abstraction 32
Language 423
language independence 434
Language independent stratified program 437 438
Language interpreter, enhanced 490—491
Lazy computation 71
Lazy directed congruence closure 133
Lazy evaluation 35 141
Lazy evaluation in denotational semantics 58
Lazy evaluation, recursive schema 129
Lazy memo function 134
Leapfrogging, in rewriting 100
Least fixpoint semantics 362
Least Herbrand model [LHM] 707 724
Least Reflective Herbrand Model 466
Legal knowledge, layers of 467
Let, construct in functional languages 32
Level of meta-program 429
LHM see "Least Herbrand model [LHM]"
Liar paradox 459
Lifting 210
Linear input format 180
Linear input resolution, for Horn sets 181
Linear resolution, refinements 175—186
Linear restriction 170
Linked heap structure 112—114
Lisp 22 71 72 500
Lisp as functional programming language 31
Lisp, compilers 111
Lisp, early implementations 34—35
Locally linear refutation 171
Locally stratified program 402
Logic 1 70
Logic program 239
Logic program, construction 773
Logic program, negation 337—340
Logic program, normal 340—347
Logic program, positive consequences 327—337
Logic program, semantics 706—707
Logic program, strategies for transformation 742—764
Logic program, stratified 341—343 343—345
Logic program, syntax 704—706
Logic program, well-founded 346
Logic programming languages 70
Logic programming languages, equational 70
Logic programming languages, examples 15—37
Logic programming languages, implementation 37—57
Logic programming languages, motivations for use 2
Logic programming languages, process of design 56
Logic programming languages, specification 7—37
Logic programming [LP] 598
Logic programming [LP] and CLP 595—596
Logic programming [LP] without NAF 295—297
Logic programming [LP], abductive proof procedure 257—263
Logic programming [LP], choice of logical language 190—191 198
Logic programming [LP], completeness in 51
Logic programming [LP], design of languages 2
Logic programming [LP], exceptions 293—295
Logic programming [LP], generalizations 2
Logic programming [LP], higher-order 422
Logic programming [LP], history 325
Logic programming [LP], incompleteness and unsoundness of implementations 55
Logic programming [LP], meanings 186
Logic programming [LP], problems of implementation 81
Logic programming [LP], sorts of negation 365—367
Logic programming [LP], soundness 51
Logical formula 7
Logical semantics 57—60
Loop absorbtion strategy 745 746
Loop fusion 753
lp see "Logic programming"
Lush resolution 187
Macsyma 595
Mc see "Minimality condition"
Me see "Model elimination"
ME refutation 183—184
Meaning in nonclassical logics 42
Meaning of a program 393—394
Mechanical engineering, use of CLP 676
Melting 120—121
Memo function 119 134
Memoing 763—764
Merge condition, in implementation 180
Meta-interpreter, basic styles 449
Meta-program 422
Meta-program, representation of program components 442—448
Meta-program, self-applicable 459—468
Meta-program, specialization 481—491
Meta-programming, amalgamated 461—467
Meta-programming, dynamic 425—426
Meta-programming, facilities 486
Meta-programming, self-applicable 425
Meta-programming, separated 460—461
Meta-programming, using ground representation 440—459
Meta-variable 465
MetaProlog 442 473
Meteor 185
MGTP 284
Minimal explanation 238
Minimal Herbrand model 363 394
Minimal logic 196 206
Minimal model 402
Minimality condition [MC] 333
ML 500
Modal completion 407
Modal logic 406—409
Modal logic of provability 407
Mode analysis 772
Model 7 519—522
Model elimination [ME] 164 181—182 see
Model, general 521
Model, standard 521
|
|
|
| Ðåêëàìà |
|
|
|
|
|
Î ïðîåêòå