Subject Index to Volumes 1–46 - COnnecting REpositories · 2016. 12. 9. · Subject Index to...

The Journal of Logic andAlgebraic Programming 50 (2002) 5–63

Subject Index to Volumes 1–46The numbers mentioned in this Subject Index refer to the Reference List of Indexed Articles(pp. 65–79 of this issue).

1-rule component, 3093-S transformation, 3833-valued model, 382

AAbadi, 197Abadi and Manna, 197abducible, 344

atom, 407predicate, 407

abducing, 511abduction, 244, 260, 331, 511, 512, 515, 516, 517,

520abduction of

intentions, 318plans, 318

abductive, 344, 511, 515, 516answer, 413approach, 514characterization of ICL, 511constraint logic programming, 515disjunctive program, 513event calculus planner, 517explanation, 516extension, 331framework, 516hypothesis, 355, 514

abductive inference, 318process, 318

abductive logicprogram, 344, 387, 413, 427programming, 407, 513, 515, 516, 517, 518

abductiveplanning, 318procedure, 413program, 344, 355, 416, 513proof procedure, 331, 512, 514

reasoning, 247, 265, 413, 445, 514, 515semantics, 355, 512theorem proving, 517

absenceof deadlock, 403of run-time errors, 465

absorption, 230, 484of definite clauses, 484

abstractalgorithm, 345and-or graph, 144answer, 377data type, 10, 93, 178, 185diagnosis, 463

abstract domain, 193, 258, 311, 425, 457, 476, 479,482, 500, 519

of set logic programs, 477abstract

equation system, 345formulation, 197framework, 373instruction set, 346

abstract interpretation, 189, 191, 193, 194, 211, 212,258, 270, 303, 306, 324, 328, 330, 348, 366,367, 417, 425, 457, 462, 463, 474, 480, 482,499, 519, 523

algorithm, 314abstract interpretation based

flow analysis system, 195global analysis of logic programs, 194

abstract interpretationframework, 193of logic programs, 144of programs, 189

abstractinterpreter, 194, 211, 499machine, 82, 105, 123, 196, 206, 231, 257, 261,

361, 366, 521

1567-8326/02/$ - see front matter 2002 Elsevier Science Inc. All rights reserved.PII: S1567-8326(01)00019-4

6 Subject Index / Journal of Logic and Algebraic Programming 50 (2002) 5–63

abstractMetaProlog engine, 414multiple specialization, 499narrower, 306object, 169operation, 258projection, 348semantics, 498sequence, 462specification, 257structure, 185substitution, 311tracer, 466

abstract unification, 348, 425algorithm, 345operation, 193operator, 425

abstract view, 466abstraction, 377, 476

function, 189mechanism, 272

ABSYS, 125AC-5, 442acceptability, 334acceptable

hypothesis, 355, 520logic program, 509program, 509

acceptor, 117, 208access

cost, 448mechanism, 448

accumulation strategy, 500accuracy of a semantics, 417ACI unification, 477ACI1 unifier, 477ACLP, 515

framework, 515acquiring data and knowledge, 492across the clause backtracking, 82acting, 400action

description language, 391, 400domain, 392language, 391, 392semantics, 391with nondeterministic effects, 390

activation stack, 105active rule, 492

in a deductive database, 492active set of substitutions, 368active-U-Datalog, 492actual

occurrence of actions, 400state of affairs, 396

actualized transaction, 327acute semantics, 133acyclic

logic program, 511program, 184, 416

acyclicity, 334added feature, 265adding negation to logic programs, 21addition

of atoms, 444of clauses, 252of constraints, 444

adjective, 56admissibility, 512

semantics, 512adorned magic fact, 386ADT, 10adverb, 56AG, 488agent, 318, 504

program, 504programming, 504

aggregation, 405Aho, 220Aho, Sagiv, and Ullman, 220AI, 501, 520

system, 133Alexander, 212

method, 212templates, 212

algebra, 83, 283algebraic, 246

approach, 477characterization, 456evaluation method, 83framework, 469language, 405point of view, 440property, 193, 477rendition, 233semantics, 324, 394, 438soundness and completeness results, 394

algebraic specification, 177of abstract data types, 63

algebraic structure, 207, 324algorithm, 15, 25, 30, 36, 48, 57, 63, 68, 80, 98, 100,

103, 124, 133, 136, 150, 152, 154, 157, 159,160, 164, 187, 194, 199, 205, 215, 218, 222,234, 252, 256, 314, 315, 345, 349, 350, 351,352, 360, 362, 380, 393, 401, 426, 448, 451,453, 481, 493, 494, 498, 504, 508, 511, 521

for automatic search, 135algorithm for deciding, 494

satisfiability, 15

Subject Index / Journal of Logic and Algebraic Programming 50 (2002) 5–63 7

algorithmfor generating, 30for linear constraint solving, 234for type checking, 145

algorithm of program synthesis, 132algorithmic

debugging, 270features of Prolog, 462

aliasing information, 193Allen, 59, 94

temporal constraint algorithm, 216allowed

database, 159, 164goal, 166program, 166

allowedness, 108, 110, 164, 224condition, 429

ALP, 513, 515alpha-beta heuristic, 40alternating

fixed points of van Gelder, 246fixpoints, 305linear space, 3space, 3time, 3tree size, 3Turing machine, 3

alternation, 3, 18alternative command, 223amalgamated, 351amalgamating knowledge bases, 351amalgamation, 302ambiguity, 481amortized time, 143amount of memoing, 377AMPE, 414analogia legis, 254analysis, 270

algorithm, 258domain, 519

analysis ofdata, 486database logic programs, 329logic programs, 402, 457, 495

analytical, 486anaphora, 459and-or

alternation, 18graph, 144model, 241

and-or parallelexecution, 241goal, 241logic programming system, 336Prolog, 336

and-or parallelism, 241and-or tree, 88, 154, 241

representation of logic programs, 88and-parallel execution, 144, 146, 194, 241

model, 146of logic programs, 99

and-parallel process, 223and-parallelism, 154, 193, 195, 223, 241, 301, 322,

371, 418, 453and-tree, 144annotated logic, 182, 351annotation

algorithm, 453method, 403proof method, 403

answer constraint, 394answer set, 260, 304, 378, 451

of a program, 416semantics, 313, 378, 513

answersubstitution, 228, 266, 353trie, 448

answering queries, 494AO-WAM, 241APPEAL programming environment, 340append, 120

program, 347append-like, 347

program, 347universal program, 347

applicability condition, 228applicative state transition system, 142approximable, 489approximatability, 489approximate answer, 351approximated narrower, 306Apt, 108, 281, 375, 456Apt and Padreschi, 281, 456Apt Blair Walker conjecture, 108Arbab, 209Arbab and Berry, 209arbitrarily deep nesting, 424arbitrator, 114arc consistency, 443architectural, 406architecture, 22, 97, 400, 406, 506, 521argumentation, 520

based abduction, 520argumentation theoretic

foundation, 355framework, 520

arithmetic, 38built-in, 509constraint, 442function, 486


arithmetic primitive, 235arity

1 predicate, 3292 predicate, 3293 predicate, 329

array data type, 505artificial intelligence, 77, 235, 327, 446, 504, 520ascendant state, 189ascending chain, 415assembler-assembler, 361assert, 107, 173

predicate, 93asserted code, 448asserting program clauses, 323associative, 477

CA memory, 16concurrent evaluation, 16content addressable memory, 16unification, 187

associativity relation, 75assumption grammar, 459AT, 212atom, 307atomic

fact, 69formula, 40, 219literal, 489

attribute grammar, 15, 28attributed structure, 363augmented

phrase structure formalism, 321theory, 260

AUNT, 112autoepistemic, 304

logic, 244, 304, 416automata theory, 192automated

debugging facility, 466decision procedure, 179deduction, 200, 364dynamic analysis, 270

automated reasoning, 397, 445, 461system, 351

automatedstatic analysis, 270system, 95

automated theoremprover, 11proving, 153, 200

automated verification, 462of Prolog programs, 462

automatic algorithm, 352automatic compile time

generation, 301parallelization, 453

automaticcontrol, 30coroutining, 68finite unfolding, 352generation, 30, 230mode inference, 84parallelization, 453

automatic programanalyser, 189source instrumentation, 503synthesis, 133

automaticprogramming, 25reasoning, 61search, 135specialization, 365synthesis of mathematical theorems, 137

automatically proving program properties, 440automating control for logic programs, 30automation, 95, 137, 440automaton, 192

state, 192axiom, 13, 87, 130, 221, 245, 327, 350, 363, 388,

389, 396, 428, 447scheme, 261, 319

axiomatic theory of actions, 389axiomatization, 428axiomatization

of KFOPCE, 202of negation as failure, 167of success and failure, 167

axioms of equality, 71, 91

BBABEL, 175

program, 175Bach, 119Bach, J S, 119back-end, 418background

knowledge, 275, 392, 484, 486predicate, 485, 486

backtrack point, 82backtracking, 10, 54, 55, 60, 99, 222, 323, 341, 368,

370search, 446

Backus, 142backward

accumulation, 500analysis, 189chaining, 139, 157dataflow analysis, 474direction, 84unification, 267

backwards proof, 51


balancing a pole on a cart, 486Bancilhon, 424Bancilhon and Khoshafian, 424Baral, 305Baral and Subrahmanian, 305base language, 350basic

algorithm, 498operation, 58, 477transformation operation, 228

batch mode system, 339Bayesian approach, 275, 501BDD, 522BEACON, 115behavior of logic programs, 38belief, 373, 504

about agents, 504data structure, 504model, 344of an agent, 504

belief revision, 512theory, 512

belief set, 260, 513semantics, 513

belief update, 512Belnap

four-valued logic, 156logic, 156

benchmark, 141, 360, 380, 410, 486, 498program, 158, 409

benchmarking, 503Berry, 73, 209Bertino, E, 492best first concurrent evaluation, 16Bezem, M, 464bi-Horn formula, 64bibliography on

logic programming, 6Prolog, 6

biconsequence relations, 420bidirectional, 117bidisjunctive logic program, 520bilattice, 156, 182, 246

based framework, 331binary chain

program, 151query, 151

binarydecision diagram, 522demo predicate, 445predicate, 319tree manipulation program, 25unfoldings, 476

binding, 16, 151, 202, 458

binding array, 241method, 241update, 241

bindingcontext, 301environment, 368, 410

binding patternlimitation, 493restriction, 493

BinProlog, 365, 459based virtual world, 459

biological, 320biological language, 320

of DNA, 320biologist, 385biquantale semantics, 471bit

map representation, 141serial content addressable memory, 141

bivalued semantics, 248black box, 339

configuration system, 339finite domain solver, 346

blackboard based logic programming, 459Blair, 108, 375block, 206

based system, 229composition, 338language, 279, 316structured language, 279, 316

blocking implication, 442blocks world, 396BNR Prolog, 235, 401Böhm-Jacopini theorem, 347Bol, 412Bol and Degerstedt, 412Boolean, 176, 401

constraint, 341, 346, 401data type, 505function, 311logic, 505valued model, 176values, 401

Bosco et al., 155bottleneck, 427bottom, 189bottom-up, 328

algorithm, 57analysis, 190

bottom-up computation, 160, 516of queries, 164

bottom-up dataflow analysis, 190bottom-up evaluation, 160, 183, 201, 448, 455

of queries, 328strategy, 70, 455


bottom-up proof procedure, 387bottom-up query evaluation, 461

method, 212bottom-up semantics, 324bound

argument, 151CSL query, 152variable, 51

boundedlogic program, 509program, 509query, 464recursion, 149term size property, 249

boundedness, 149, 329, 464boxing, 380branch and bound, 237

like procedure, 374branching heuristics, 215Brass and Dix, 439Brass, S, 439bridge, 113

playing program, 113Broda, K, 36Bronsard et al., 403BSL, 119buffer referencing characteristics, 158bug diagnosis, 67building

expert systems, 96programs as combinations, 272

built-in predicate, 428Buntine model of generalization, 484Byrd box model, 88

CC code, 369, 380

generator, 365C program, 362C-ification of binary Prolog, 365C-semantics, 353, 509CA memory, 16CAD, 341

tools, 341calculus, 171, 172, 223, 283, 332, 390, 391, 396,

439, 517for nondeterministic specifications, 177

calculus ofcommunicating sequential logic processes, 223dependencies, 133order sorted feature approximation, 233program transformations, 439

calland return, 417by need strategy, 15

consistent programs, 280, 317path, 192

call pattern, 330, 465semantics, 480

call/exit/fail/redo procedural model, 88calling

mode, 360pattern, 258

cancer treatment, 337canonical, 47

form, 179canonical general

logic program, 101program, 101

canonicallogic program, 47minimal model, 114

canonical model, 221semantics, 221

canonical strongly linear query, 152capabilities of a source, 494capability, 466, 486, 494

description, 494capacity constraint, 342cardinality, 413, 442Cartesian product, 401CAS-equivalent logic programs, 120case

analysis, 168, 407semantics, 171

Catania, B, 492categorial grammar, 321categorical, 94

construction, 469semantics, 469

categoricity, 265category, 410causal law, 392causes of nonunifiability, 60Cavedon, 110, 166Cavedon and Lloyd, 110, 166cc framework, 442cc(FD), 442CDB, 5, 110CDH, 520centralized dynamic load balancing, 100CFG, 358CFT, 261, 319CGI programming distributed object brokerage, 459chain, 415

Datalog program, 309program, 488rules, 488

Chan, 334constructive negation, 334


change inbelief, 373knowledge, 373

changingenvironment, 400world, 373

chaotic iteration of closure operators, 444character, 338

description, 338dictionary, 338set, 338sketch, 338

characterisation, 397characterisation

of persistence, 397of steadfastness, 454

characteristics, 234, 426of sequential Prolog programs, 46

characterization, 128, 183, 185, 223, 309, 334, 344,382, 456

characterizationof alternating linear space, 3of EGCWA, 520of nondeterministic linear space, 3of stable models, 333of static discontinuity grammars, 332of the class of nondeterministic time polynomial

queries, 419of the disjunctive stable semantics, 382of the expressiveness of dynamic choice, 419of the wellfounded model, 248of uniform boundedness, 149

characterizingdescendants, 189logic grammars, 332

CHDL, 341checking satisfiability, 215Chen, 253, 412Chen and Warren, 412Chen, Kifer, and Warren, 253CHIP, 116, 235, 346chip area, 406CHIP programming language, 235choice

logic, 511point buffer, 158

CHORAL, 119chorale melody, 119chord skeleton, 119CHR, 441

language, 441, 466Chronolog, 197Church Turing thesis, 185circuit, 61, 112

description language, 112

circumscribed theory, 315circumscribing embedded implications, 251circumscription, 35, 243, 244, 251

axioms, 251with fixed predicates, 416

Clark, 5, 31, 44, 72, 110, 245Clark and Shepherdson, 31Clark completed

data base, 31database assumption, 5

Clark completionof a program, 140semantics, 389

Clark Kunen completion, 469of a program, 469

Clarkpredicate completion, 35program completion, 221query evaluation procedure, 5semantics, 67

classof constraints, 423of languages, 320of logic programs, 451of queries, 267

classicallogic, 31, 36, 38, 251, 375, 389negation, 39quantifier, 36reasoning, 42set theory, 447

classification, 29, 254, 486of meta-interpreters, 96

clausaldefinition, 486intuitionistic logic, 76, 79language, 76specification, 85superposition, 9theory, 405

clause, 12, 19, 37, 40, 42, 60, 78, 85, 93, 101, 143,146, 193, 199, 215, 218, 230, 316, 389, 415,451, 475, 486

body, 279, 316, 455composition operator, 377

clause head, 191matching, 88

clause indexing, 141method, 141

clauseset, 218variable, 311without implication, 19

Cleary, 235


client serverapplications in Prolog, 459dynamics, 459

closed block, 316closed form

bottom-up evaluation procedure, 423expression, 322

closed typed first orderformula, 26logic formulas, 41

closed world assumption, 5, 44, 122, 187, 213, 239,260, 308, 431

closed world reasoning, 244rule, 308

closedness, 161condition, 229

closureoperator, 128, 444property, 5

CLP, 234, 236, 237, 273, 346, 374, 404, 438, 439,440, 442, 444, 479, 515

framework, 515language, 374, 442, 515paradigm, 237program, 374programming, 374scheme, 236, 237system, 438

CLP(BNR), 401CLP(χ ), 440CLP(D) languages, 236CLP(FD), 346, 450

solver, 450system, 346

CLP(N), 440CLP(R), 385

library, 476program, 404

CLP(R+M), 404CLP(RT), 440CLP{�∗}, 440clustering, 486co-NP-complete problem, 311coarse-grain parallel program, 384code generation, 341code improvement, 186

scheme, 186code

optimization, 189transformation, 186

Cohen, 418coherence, 506coherent framework, 511coincidence theorem, 500

COL, 283, 424collapse, 18collect all capability, 180collecting

semantics, 189trace information, 503

Colmerauer, 7, 125Colmerauer and Kowalski, 125combination of assignments, 450combinational circuit, 61combinator, 442combinatorial

explosion, 55problem, 116, 442, 505

commercial law, 254commit

cut, 222operation, 104

committed choice language, 441committed choice logic

program, 104programming language, 418

committed choice nondeterminism, 104common memory, 16common sense

axiomatization, 245inference, 354knowledge, 260, 392law of inertia, 373

common sense reasoning, 245, 354about actions, 400

communicate, 492communication

granularity control, 474mechanism, 223primitive, 223

commutative, 477commutativity, 207

in query processing, 207compact, 126

hypothesis, 485representation, 311

comparing types, 199compilation, 85, 170, 193, 365, 366, 417

algorithms, 222built-in predicate, 366method, 170

compilation ofProlog, 109set terms, 170SLDR-resolution, 322

compilationtechnique, 109tool, 195


compile, 55compile-time, 107, 170, 192, 314, 362, 369, 380,

422, 479condition, 301derivation, 144, 194garbage collection, 189type checking, 145

compiled, 55, 109, 322, 346, 448compiled code, 180, 222, 503

instrumentation, 503compiled

Prolog program, 196WAM like code, 448

compiler, 23, 84, 105, 107, 192, 193, 222, 285, 301,360, 361, 367, 453

based metalevel system, 414design, 361from Horn clauses to dataflow graphs, 181implementation, 285optimization, 361, 362, 406

compiling, 180associativity, 75constraints, 346control, 95propositional disjunctive programs, 387

complement, 29, 47of a relation, 419

completable by negation as failure, 126complete axiomatization, 261, 319complete characterization, 126

of the expressiveness of dynamic choice, 419complete

database, 426disjunctive hypothesis semantics, 520equality theory, 37for D-WFS, 461for GCWA, 461for WFS, 461inference system, 129information, 431lattice, 38logic program, 11, 87loop check, 227normalization strategy, 363process model, 154proof, 438query evaluation procedure, 5realization, 187relational algebra, 83

complete set, 90, 359, 444of E-unifiers, 359term, 431

completed database, 5, 31, 44, 110assumption, 5

completeddefinition, 187logic program, 127program, 121

completely defined predicate, 239completeness, 5, 37, 68, 90, 104, 108, 161, 199, 248,

249, 258, 319, 359, 400, 413, 429, 438, 484of an execution model, 444of programs, 104

completeness of Prolog, 72evaluation, 167

completenessof query evaluation, 41of refinement operators, 415

completeness of SLDNFdeductions, 110resolution, 224, 343

completeness proof, 319completeness result, 87, 90, 175, 224, 413, 429

for SLDNF resolution, 224completeness theorem for SLDNF resolution, 108completion, 50, 127, 396, 429

of a program, 429of theories, 126semantics, 391, 407

complexobject, 424property of logic programs, 330system, 339

complex valuemodel, 431relation, 431

complexity, 57, 64, 85, 99, 103, 138, 145, 244, 265,311, 337, 379, 504, 508, 513

analysis, 349bound, 423class, 416measure, 3, 64of computations, 3of derivations, 3of query evaluation, 327of revising logic programs, 489result, 243, 244

compliance, 337composing theories, 473composition, 58

of two theories, 473composition tree, 336

abstraction, 336compositional, 266, 272, 456, 469

approach, 330operator, 272semantics, 469sequences of logic program updates, 507


compositionality, 358, 469, 473of programs, 473

compound, 501action, 517

comprehensibility, 413compromises, 413computability over abstract structures, 185computable

completion, 221query, 424semantics, 101

computationdomain, 237is deduction, 235model, 63on quantified terms, 80plan, 170rule, 17, 95strategy, 63time, 209, 303trace, 136tree, 18

computational behavior of Prolog programs, 78computational complexity, 3, 244, 307, 312, 333,

416, 489of logic programs, 3

computational cost, 485estimation analysis, 474

computationallearning theory, 275linguistics, 325, 326logic, 162, 456

computational model, 48, 123, 133for logic programs, 32

computationalpower, 63, 347property, 76, 181, 308results, 218, 401

computationally complete, 64computed answer, 377

constraint, 374semantics, 480, 498substitution, 353

computedinstance, 465substitution, 457

computeraided design tools, 338hardware description language, 341program, 486

computingabduction, 516abductive explanations, 344, 516

concept learning, 487conceptual change, 88

concise programming, 505concurrency, 50, 418concurrent

actions, 391, 399algorithms, 48binding environments, 368branch and bound, 374

concurrent constraintlanguage, 474logic programs, 356

concurrent constraint programminglanguage, 418system, 418

concurrentconstraint programs, 474evaluation, 16inference engine, 418

concurrent logicprogram, 467programming language, 285

concurrent Prolog, 43, 48, 100, 104, 105implementations, 48program, 48

concurrent pruning, 374mechanism, 374

concurrent readconcurrent write, 98exclusive write, 98

condensing, 193conditional

dependency graph, 453equations, 92expression, 453fact, 461logic, 512programming language, 512reasoning, 512update, 512

conditions for decomposability, 165configuration, 115, 339

application, 339expert system, 115of large computer systems, 115problem solver, 446system, 339task, 339

conflicting, 45information, 156sets of information, 397

confluence, 179of CHR programs, 441

confluent, 356, 363, 438normalization rule, 363semantic basis, 356semantics, 356


congruenceclosure, 90proof, 78

conjecture, 261, 418of Apt, Blair, and Walker, 108

conjunction, 55, 505conjunction

of atoms, 440, 497, 498of literals, 453of universally quantified clauses, 93operator, 501with comma, 55

conjunctive, 498partial deduction, 498, 510plans, 493queries, 424

conjunctivity, 197connected database, 159connective, 378conservative extension, 122, 378consistency, 44, 122, 127, 199, 265, 397

based diagnosis, 446of negation as failure, 44of the closed world assumption, 122proof, 33

consistent, 5, 127, 140, 143, 166, 337, 385belief set, 260completion, 127, 221design, 338extension, 449first order extension, 44solution, 450universal first order theory, 176

Console et al., 407constrained solving, 515constraint, 458, 479

answer, 458constraint based

configuration, 446meta-interpreter, 445specification, 446

constraintdomain, 439entailment, 442fact, 238

constraint handlingcapability, 505in Prolog, 116rule, 441, 466

constrainthierarchy, 236information, 238

constraint language, 162, 417, 442NCL, 505

constraint logic, 445language, 324, 442program, 324, 328, 394, 453, 479

constraint logic programming, 117, 129, 162, 233,236, 237, 273, 324, 341, 342, 438, 439, 440,442, 444, 446, 450, 515

framework, 324language, 116, 346, 394, 401, 441, 446over finite domains, 342paradigm, 216solver, 450

constraintoperation, 442over the real numbers, 443paradigm, 236program, 474

constraint programming, 261language, 418

constraintpropagation, 134, 237, 328, 444query language, 238

constraint satisfaction, 237, 385technique, 235

constraintsatisfiability, 234selection, 238solver, 346, 418, 438, 439, 441, 442, 476, 479

constraint solving, 233, 237, 273, 328, 338, 446, 515method, 169process, 346technique, 116

constraintsystem, 117, 236, 261, 319, 324, 441, 446, 505theory, 439

constructiveabduction, 515disjunction, 346, 442

constructive negation, 334, 374, 458, 469by pruning, 374

constructiveproof, 134rationalization of Prolog, 42synthesis, 269theory, 42

constructor basedconditional rewriting logic, 460rewriting logic, 460

constructor discipline, 175containment, 220content addressable memory, 16context dependent syntax, 505context free grammar, 15, 117, 255, 358, 370

rule, 14context free language, 14, 309, 320


context sensitivedata typing, 505information, 370

context switching among theories, 414contextual

information, 370precondition, 56

continuation, 66, 92continuity, 383continuous, 38, 383

immediate consequence operator, 469continuum of uncertainties, 40contradiction removal, 260

semantics, 247, 318contradictory

information, 391, 507programs, 260specifications, 391

control, 498algorithm, 157, 510annotation, 32

control flow, 258, 362information, 109

controlinformation, 30instruction, 231knowledge, 414language, 95mechanism, 32of database procedures, 30of industrial processes, 388of logic programs, 30of recursive procedures, 30of robots, 388primitive, 30rules of Prolog, 480statement, 193strategy, 183, 258structure, 365structures, 307through speech, 459transfer, 66

controlledEnglish interface, 459language, 459

conversion rule for list manipulation, 13Conway, J H, 347cooperating

processes, 54rewrite processes, 54

cooperation, 492cooperative information

management, 492seeking, 318systems, 492

cooperativequeries, 492query answering, 405

cooperative update, 492propagation, 492

coordinate conjunction, 55coordination, 459copyback cache, 158CORAL, 475Cordell, 517coroutined

execution, 30matching, 208

coroutining, 52, 341, 365behavior, 95execution, 95mechanism, 341

correct answer, 166substitutions, 120

correct program, 120, 134correctly typed program, 353correctness, 27, 71, 74, 78, 95, 120, 144, 194, 211,

252, 268, 269, 301, 389, 395, 403, 428, 454,465, 497, 498

criterion, 403of parallel execution, 301of set unification, 447of the unfold/fold transformation, 313of unification, 256properties of pure Prolog programs, 428relation, 395

cost sensitive literal reduction, 487counterexample, 383counterfactual, 396counterfactual reasoning, 512

problem, 390counterfactual statement, 390counting, 152

method, 152Cousot and Cousot theory of abstract interpretation,

190cover, 464

set, 415covering, 485CPL, 162CRCW, 98credulous

EC, 452reasoning, 520

CREW, 98cross product, 241, 384

node, 241of solutions, 241

CRSX, 247, 318


CSL query, 152CSLD derivation, 444customised search, 486cut, 73, 78, 88, 100, 109, 222, 336, 480

(in Prolog), 209clause, 100free Prolog, 78goal, 100operation, 104operator, 480

CWA, 5, 239, 426cycle, 114, 443, 521

unification, 267cyclic

phenomena, 443query, 152

DD-WFS, 439, 461DAG, 98Dahl, 55, 332Dahl and McCord, 55DAS, 520DASWAM, 371data

abstraction, 63cache, 97complete, 379complexity, 283, 375, 379

data dependency, 82, 99based method, 82condition of strictness, 110

datadomain, 379driven production system, 115

data flowanalysis, 189problem, 15

data integration, 493system, 493

dataitem, 46logical view, 340memory performance, 158object, 190or-parallelism, 368

data parallelabstract machine, 418concurrent constraint programming, 418

dataparallelism, 418retrieval system, 340structure, 80, 99, 143, 184, 326, 351, 448type, 505

database, 5, 16, 31, 33, 36, 44, 73, 77, 150, 151, 159,173, 202, 283, 312, 315, 327, 338, 340, 375,405, 426, 492, 494

constraint, 93deduction, 5deletion, 36language, 148logic programming, 147

database management, 36system, 33

databasemanipulating predicate, 336programming, 405

database query, 202, 379evaluation, 202

databasestate, 327system, 405transaction, 327update, 171, 327view, 327

dataflow, 190, 258analyses of logic programs, 348

dataflow analysis, 84, 190, 258, 362of logic programs, 258

dataflowdependency, 99graph, 85, 181information, 109, 417

Datalog, 220, 312, 333, 419, 422, 423, 431, 439, 508Datalog like constant manipulating predicates, 352Datalog program, 151, 183, 201, 329, 422, 481

with negation, 422Datalog query, 201, 220Datalog

with choice, 335with nondeterministic choice, 419

Datalogf , 220DatalognS, 312Davis Putnam algorithm, 103Davis Putnam Loveland algorithm, 218Davis Putnam procedure, 451DCG, 208, 320, 332, 358, 370

grammar, 219like formalism, 139

DCSG, 139syntax, 139

DDAS, 371De Schreye, 407de-evolution, 285

of concurrent logic programming languages, 285deadlock, 403, 467, 474Debray, 209Debray and Mishra, 209


debugging, 88, 189, 270, 463, 466, 503facility for Prolog, 88tool, 59

DEC-10 Prolog, 46decidability

of logic program semantics, 509problem, 509

decidable, 220, 312classes of bounded recursions, 149property, 441

deciding boundedness, 329decision algorithm, 404decision method, 261

for CFT, 261decision

problem, 309procedure, 129, 179, 440, 509

decision support, 236, 337system, 340

decisiontheory, 511type problem, 103

declarativeapproach to interoperability, 405bias, 275, 485

declarative diagnosis, 463technique, 463

declarativeencoding of GMEC, 452formalism, 142framework, 333interpretation, 353language, 142, 178, 397, 399, 441logic program, 235

declarative logic programming, 265language, 369system, 440

declarativemediator language, 491nondeterministic constraint logic language, 442paradigm, 273predicate, 25

declarative programming, 142, 447, 460, 462paradigm, 274

declarativeProlog program, 25properties of logic programs, 403reasoning, 465

declarative semantics, 67, 81, 101, 110, 161, 175,278, 351, 374, 469, 471, 507, 509, 515

for logic programs, 471declarative semantics of Prolog, 209

programs, 209declarative state transition system, 142declarativeness, 338

DECmpp, 418decomposability, 165decomposable, 165

program, 165decomposition, 309

of chain datalog programs, 309deduction, 5, 40, 83, 130, 138, 235, 364

engine, 321in incomplete databases, 83process, 257rule, 102step, 138system, 5, 321theorem, 93

deductive calculus, 424deductive database, 26, 41, 77, 83, 159, 164, 202,

219, 286, 379, 430, 475, 487, 491, 492, 521language, 379query language, 424system, 12, 26, 41, 286, 349, 375

deductiveobject database, 492parsing, 321program synthesis, 134query language, 424rule, 33synthesis, 135, 269

deductive tableau method, 102for program synthesis, 102

deep cut, 222default, 114, 236, 478

assumption, 514equation solver, 523logic, 244, 392, 478negation, 507query, 163reasoning, 114, 260, 445, 502rule, 373theory, 243, 392

defeasiblelogic, 502reasoning, 247, 333

definability, 185of relations, 185theory, 213

defined predicate, 407defining power, 213

of stratified and hierarchical logic programs, 213definite, 5

axiomatic basis, 42definite clause, 11, 42

fragment, 405grammar, 88, 208, 320, 321, 358, 370logic program, 11


definite clauseprogram, 42set grammar, 139

definitedatabase, 31freeness of terms, 345logic program, 199, 230, 265, 497program, 226, 248, 471, 473, 484rule, 251

deforestation, 498Degerstedt, 412degree

of a stable model, 282of definedness, 246of truth, 246

delaycondition, 464declaration, 464, 467execution of goals, 362operation, 521primitive, 362recurrent, 464

delayed, 394call, 394function call, 314installation, 106

deletion, 307, 375of atoms, 444of clauses, 252of constraints, 444

Delphi lemma, 377demand transformation analysis, 474demon, 92Denecker, 407Denecker and De Schreye, 407denotation, 81, 480

of intensional operators, 197denotational and operational semantics, 78, 209

of Prolog, 209denotational

continuation style semantics of Prolog, 73model, 209

denotational semantics, 78, 189, 203, 480for logic programs, 239for Prolog with cut, 480of Prolog, 73

denotationally equivalent, 203dependence of goals, 184dependency, 99, 146, 194, 522

between arguments, 159between calls and answers, 455between constituents, 276between variables, 84graph, 453information, 310

dependentand-parallelism, 371status, 371

depth boundedbottom-up evaluation of logic programs, 312evaluation, 312

depth complexity measure, 3depth first

evaluation, 16, 471logic programs, 471

depth first search, 54rule, 462

depthfirst subgoaling, 51of recursion, 329

depth(k) answer, 463Deransart, 403dereferencing, 97, 186, 234derivability

of disjunctive programs, 128relation, 414

derivation, 68, 94, 102, 114, 130, 389, 396, 422, 444derived

dependency, 159program, 230

descendant, 205descending chain, 415describing narratives, 397

with actions, 397description

domain, 417of query capabilities, 494

descriptive language, 63descriptor, 380

primitive, 141design, 375, 379

automation, 61decision, 500of abstract machines, 231of algorithms, 451of proof methods, 189

destructive assignment, 48, 171detecting

bounded recursions, 149uninitialized arguments, 360

detection, 59, 362, 499of fixed variables, 234of repeated subgoals, 458

determinacyof predicates, 222predicate, 177

determiner, 56determinism, 369


deterministiccomputation, 185control structure, 27finite automaton, 192logic program, 377nature of functions, 314problem, 419

deviation, 498diagnosis, 130, 445

problem solver, 446theory, 446

dialect of LISP, 71dialogue, 318difference list, 311, 467differential

approach, 70method, 417

digital circuit analysis, 61, 341direct inference, 431directed

acyclic graph, 4, 98equation, 92graph, 152

directional type, 403disconnection method, 439discourse sentence, 318discrete event, 162

process, 162simulation, 388

discriminating predicate, 201discrimination, 448

net, 448disentailment, 261disequality

constraint, 401subclass, 234

disjunction, 65, 265, 368, 442, 450in logic programs, 439of conjunctions, 407of negative literals, 520of substitutions, 65operator, 501

disjunctive, 382, 387, 478, 514and cumulative conjunctive constraints, 342completion, 500constraint, 450Datalog, 508deductive database, 520

disjunctive default, 478logic, 478

disjunctiveEK procedure, 514Herbrand state, 383hypothesis semantics, 520

disjunctive logic program, 128, 304, 315, 378, 382,383, 387, 408, 451, 514, 520

with functions, 408disjunctive

logic programming, 387, 408, 508, 513, 514, 520partial deduction, 387

disjunctive program, 344, 382, 416, 451, 461, 513,514, 520

with integrity constraints, 344disjunctive rational trees, 303disjunctive scheduling, 116

problem, 442disjunctive stable model, 520

semantics, 408disjunctive

stable semantics, 520type, 303wellfounded semantics, 439

distinguishing, 395distortion, 168distributed dynamic load balancing, 100distributed logic, 223


distributed memory, 384, 506architecture, 506multiprocessor, 384

distributedmodel, 223shared memory, 506

distribution information, 489distributional information, 489distributivity, 407divergence, 480divide and conquer, 485

strategy, 181Dix, J, 439DLP, 513DNA, 320

molecule, 385sequence, 320

document, 236formatting, 236

domain, 311, 397, 417, 519augmentation, 245characteristics, 402

domain closure, 245axiom, 87

domainconsistency, 442constraint, 396description, 397foundation axiom, 245independence, 253


domain knowledge, 8modeling, 339

domainLSign, 479of a constraint, 236

domain of positiveBoolean functions, 522propositional formulas, 348

domainPat(Prop), 311Prop, 311, 330theory, 446variable, 418

don’tcare nondeterminism, 17, 104, 333know nondeterminism, 104, 146

Dorpp, 506doubly linked chain, 205Dowling, 65, 103, 124Dowling and Gallier, 65, 103, 124

top-down algorithm, 124DPAM, 418DPL, 103dscons, 447DST system, 142dual largest stable model, 246dualized program, 245Dung, 305duplication, 201Dwork, 98Dwork, Kanellakis, and Stockmeyer, 98dynamic

analysis, 270analyzer, 46choice, 419classification, 86code, 448configuration, 229constraint, 505dependent and-parallel scheme, 371detection, 371domain, 388environment, 444generation, 84goal, 107integrity constraint, 327load balancing, 100

dynamic logicprogram, 107programming, 507

dynamic optimization, 443dynamic program, 107

update, 507dynamic

programming, 181

properties of programs, 189scheduling, 394, 467selection rule, 464, 467structure, 410systems, 391task migration, 357type checking, 199update, 507visibility rule, 279, 316world, 388

dynamicallystratified, 521typed language, 380

EE-unification, 90E-unifier, 90, 359eager

method, 152rewriting, 92variable elimination, 460

early discovery of satisfiability, 215East Asian ideograms, 338EC, 452ECLiPSe, 515EDB, 422edge, 261, 277EDS, 215effect

axioms, 389of an action, 388, 399

effectivecompilation scheme, 363query evaluation, 458

effectively closed set, 282efficacy, 337efficiency of parallel execution, 301efficient

algorithm, 151, 234, 386, 487evaluation, 150, 151execution of programs, 95

efficient implementation, 10, 84, 106, 123, 218, 274,323, 330, 414

language, 48efficient

program, 85reuse, 351solution, 218

efficiently executable program, 328EFS, 187EGCWA, 520Eiter, T, 504electrical circuit, 61electronic circuit description language, 112


elementgrouping, 148insertion operator, 350

elementaryformal system, 187module, 58

elided element, 55elimination of

contradictions, 382redundant answers, 458tautologies, 382

ELPS, 283EM, 83embedded

hypothetical implication, 429implication, 76, 79, 251, 429logic engine, 459

empirical performance, 377emptiness problem, 347empty

element, 55string, 15

emulator, 105, 365instruction, 365

encoding, 236, 347, 373, 391, 430engine, 414, 521

level, 448engineering problem, 486English, 55, 459

like representation, 459entailment, 261, 391, 400

relation, 400enumeration, 58

operator, 58enumerative

algorithm, 103nondeterminism, 92

environment, 16, 142, 301, 360, 368allocation, 186tool, 270trimming, 257

epistemic, 304modal logic, 202semantics, 304

ε-queries, 429ε elimination, 14Eqlog, 10, 90equality, 10, 11, 20, 71, 91, 129, 153, 169, 234, 350,

407axioms, 71, 91for logic programming, 10, 20of terms, 404relation, 9theory, 11, 477

equationamong feature paths, 363over datatypes, 10set, 306

equationalassertion, 180clause, 475constraint, 439

equational Horn clause, 90program, 359

equationallanguage, 63logic, 178, 460

equational logic program, 90with negation, 391

equational logic programming, 155equational program, 63, 71

clauses, 475equational programming, 98, 125, 180

language, 63, 129equational

rewriting, 71theory, 306, 391unification, 306

equi-join, 160equilibrium logic, 449equivalence, 220, 315

formula, 497equivalence of

Datalog queries, 220logic programs, 389semantics, 305wellfounded and stable semantics, 317

equivalence preserving transformation, 488equivalent

formula, 407logic programs, 120program, 120theories, 397

EREW, 98error

diagnosis, 67of method, 385

Eshghi, 331, 355, 514Eshghi and Kowalski, 514

abductive procedure, 331procedure, 355

Eshghi Kowalski procedure, 514Eureka, 497

definition, 230evaluable predicate, 159evaluation, 68, 71, 270evaluation algorithm, 315

for logic programs, 312evaluation mechanism, 381


evaluation method, 312, 386for logic programs, 16

evaluationof a program query pair, 238of data intensive Datalog programs, 183of functions, 314of logic programs, 455parameter, 158procedure, 423process, 165strategy, 78, 455

event, 318, 501calculus, 171, 318, 390, 396, 397, 452, 517

evidential transformation, 383evolution, 452

of a database, 327of sequential logic languages, 271

examination timetabling, 342problem, 342

exampleelimination, 487guided unfolding, 485

exchange, 357of information, 357

excluded, 181exclusive read exclusive write, 98exclusiveness among clauses, 222executable, 117

object, 178executable specification, 395

of circuits, 61executing squeezes, 113execution

algorithm of Mercury, 369cost, 170model, 88, 146, 206, 369, 384, 403, 444of dynamic programming problems, 181profile for a program, 470time, 133, 301

existentialgoal, 323quantification, 505quantifier, 323sentence, 176termination, 267

existentially quantified constraint, 261expanded query, 426expanding queries, 426expectation, 516expected complexity bound, 48expensive process spawn myth, 105experimental

data, 357, 385results, 138, 393, 425, 443, 470, 509

expert, 88, 113chemist, 486database systems, 77

expert system, 40, 113, 119construction, 96knowledge representation technology, 340with uncertainty, 182

expertise, 153explanation, 511

of negation, 511explicit

indeterminism, 391negation, 247, 318

exponentialbehaviour, 522chain, 482

exponential size, 482code, 222

expressibility, 12, 375, 379expressive, 494

capabilities description language, 494expressive power, 10, 21, 173, 255, 307, 375, 408,

419, 422, 424, 494, 502, 505, 508of EC, 452of fixpoint logic, 422of Horn clause logic, 76of query languages, 508of stratified Datalog, 422

expressiveness, 202, 254, 401, 408, 465of dynamic choice, 419of logic programming, 347

expressivity, 285, 397extendable, 466

trace, 466extendable trace analyzer, 466

for Prolog, 466extended

and-or tree, 241disjunctive program, 416

extended generalizedclosed world assumption, 520logic program, 478

extended goal, 12extended Herbrand

base, 128semantics, 302

extendedHorn clause logic, 2interpretation, 266language, 68, 350, 404, 450

extended logiclanguage, 272program, 247, 260, 313, 318, 399, 426programming language, 350


extendedmodel, 83, 266programs, 12Prolog, 341query, 426relational algebra, 83stable model, 331unification algorithm, 68use, 93WAM, 206, 241

extending Prolog with nonmonotonic reasoning, 354extensibility, 442extensible multi-user virtual world, 459extension of Datalog, 312extension of logic programming, 265, 333

languages, 316extension

of Prolog, 19, 36, 168, 216table, 212

extensionaldatabase, 278, 422notion of universal quantification, 239

extensionally defined atom, 307external world, 202extraction, 270extralogical operation, 73extraposition grammar, 208extremal problem, 451

Ffactoring, 407fail branch, 414failure, 24, 29, 37, 44, 222, 239, 301, 353, 502

continuation, 66of logic programs, 45set, 37, 45, 94, 190, 239soundness, 104to prove, 308

faircomputation, 24infinite computation, 24, 81selection rule, 343

fairness, 343property, 223

faithful simulation, 64theorem, 64

family of logics, 502family of stable models, 282

of logic programs, 451fast Fourier transform, 85FCP, 100

for FCP, 145implementation, 100

feature, 261and arity constraint, 319

feature constraintlogic, 169with quantifiers, 169

feature description language, 169feature tree, 261

structure, 261system, 319

federation of INGRES databases, 405FF-SM semantics, 331file system update, 142final knowledge base, 372finitariness, 197finite domain, 342, 442, 450, 463

constraint, 346, 418finite failure, 17, 29, 94, 104, 394

semantics, 498set, 47, 101, 121stable model semantics, 331

finiteground program, 439many-valued logic, 156meaning, 330predicate logic program, 282

finite set, 447of atoms, 161, 509of clauses, 411of rewrite rules, 208

finitetime, 144unfolding, 352

finitely, 203approximated, 81

finiteness of query answers, 312Firebird, 418

computation model, 418language, 418

firmware design, 116first class

continuation, 66object, 450

first order, 41, 253clausal theory, 275DCG, 358deduction system, 364formula, 12, 21, 26, 41, 202functional notation, 175hereditary Harrop formula, 239

first order logic, 9, 12, 24, 41, 44, 56, 78, 102, 198,256

formula, 26, 319solution to scientific problems, 486with identity, 2

first order predicatecalculus, 32, 119, 405logic, 10, 40, 169


first orderpresentation, 245program, 439query, 21reified logic, 216representation language, 327rewrite rule implementation, 10

first order semantics, 405for logic programs, 221

first ordersentence, 202structure, 261term, 49, 261theorem proving, 202theory, 176, 428

Fitting, 72, 245, 331, 374, 429Fitting and Kunen, 429Fitting

bilattice based logic programming, 182comp3, 461Kunen three-valued logic semantics, 374operator, 374�p semantics, 190semantics, 304

fixedfeature graph semantics, 169mode logic program, 370placement policy, 470

fixed point, 38, 472,see also fixpointconstruction, 93semantics, 76, 94, 120, 156, 236, 429theorem, 472

fixpoint, 21, 37, 189, 193, 266, 278, 305, 383,see also fixed point

algorithm, 194, 443fixpoint characterization, 315, 344

of Kunen semantics, 374fixpoint

computation, 258logic, 422method, 40of a disjunctive program, 344operation, 383operator, 128, 221

fixpoint semantics, 9, 27, 67, 128, 197, 203, 278,335, 344, 359, 374

for abductive logic programs, 344of logic programs, 145

fixpoint theory, 40, 375, 405, 501flat concurrent

logic programming language, 361Prolog, 43, 100, 105

flatinput and output, 424logic program, 429

program, 429relation, 424

flexibility, 361flexible record, 363floating point

arithmetic, 235computation, 235intensive computation, 380number, 235, 401operation, 235

floundering, 159, 217, 224, 334, 343, 412, 429abduction problem, 413negation problem, 413

flow analysis, 107, 195Floyd, 481Floyd Warshall algorithm, 481fluent formula, 392foldable U-tree, 230font design, 338

tool, 338Forbus qualitative process theory, 216fork-join approach, 384formal correctness, 454

proof, 428formal

derivation, 102justification, 345

formal language, 38defined by an EFS, 187design, 209

formalmethod, 269model, 40proofs, 120semantic basis, 476

formal semantics, 172, 182, 189, 307, 476, 504of a program, 509

formal specification, 117, 496of unification, 2

formalsynthesis, 102system, 363, 447

formal theory, 428of action, 388of databases, 77

formalization, 251, 327, 340, 352, 399of SLDNFA, 413

formalized language, 137formula, 26, 41, 83, 202, 378

language, 326formulation, 94forward

accumulation, 500analysis, 189chaining production system, 278


forward inference, 488method, 488

forwards, 51proof, 51

Foster, 142foundations, 268, 420, 421, 498, 510

of LPTP, 428four-valued

inference, 420, 421logic, 156

fragment, 508of classical logic, 39of disjunctive Datalog, 508

frame, 241frame problem, 327, 389

in artificial intelligence, 327in the situation calculus, 171

framework, 311, 395free

term model, 460variable, 163, 191, 202word order language, 139

freeness, 447analysis, 345information, 345

Fribourg, 155front end, 409, 418full

dependency, 493sharing, 386test unification, 100

fully abstract, 374, 469categorical semantics, 469

fullyground atomic protected theory, 35instantiated, 394

function, 26, 41, 142, 180, 182, 219function free

Horn clause program, 151program, 184, 458stratified PS program, 278

functionin logic, 52symbol, 152, 160, 220, 312

functional, 500analysis, 500dependency, 335, 493

functional language, 9, 50, 52, 68, 470implementation, 470

functionallogic language, 274paradigm, 460program, 50

functional programming, 10, 13, 68, 71, 98, 175,233, 274

paradigm, 50, 90functionality, 96, 105, 303

of classes, 363functor free program, 412fundamental

form of set designation, 350property, 301

fuzzy set, 40

GGabbay, 168Gabbay and Reyle, 168Gaifman et al., 329Gallier, 65, 103, 124, 359Gallier and Raatz, 359Galois connection, 189, 190game, 113

of diplomacy, 114program, 281rule, 114theory, 40, 511tree, 40

gap order constraint, 423gapping grammar, 208garbage, 16

collection, 16gate assignment, 61Gaussian elimination, 234GCWA, 382, 461GEDP, 416Gelfond, 304, 331, 392, 397, 399, 461Gelfond and Lifschitz, 331, 392, 399

language, 397STABLE, 461stable model semantics, 331

gene expression, 320general extended disjunctive program, 416general failure, 29

of logic programs, 45general logic program, 37, 94, 101, 226, 334, 426

with equality, 37general purpose

architecture, 406combinator, 442set matching algorithm, 170

general rule, 69generality, 413generalization

by absorption of definite clauses, 484of Datalog, 423rule, 230strategy, 230


generalizedannotated logic programming, 182Church Turing thesis, 185constraint propagation, 237logic program, 378, 507magic predicate, 160metric space, 472modal event calculus, 452parsing problem, 139propagation, 237semantics, 308, 324stable model, 516subsumption, 484unification, 11

generate and test method, 119generating

parsers, 14, 321programs, 445

generation of efficient code, 186generator, 208generic abstract interpretation, 144

algorithm, 311generic

algorithm, 237analysis of logic programs, 417database query, 379fixpoint algorithm, 303ILP algorithm, 275

generic module, 10mechanism, 178

genericpattern domain, 303proof method, 440query, 379reduction technique, 329representation, 115top-down analyzer, 402

generics for logic programming, 10, 20GenLang, 320geographical

data, 491information system, 491

Gervasi, V, 492GHC, 100Ginsberg, M, 156glass box approach, 346global analysis of programs, 23global compilation

of Prolog, 109technique, 109

globalconstraint, 505control, 498flow analysis, 195optimization, 23, 222

SLS resolution, 184, 249static analysis, 367tree, 184variable, 16

GMEC, 452goal, 279, 316, 343

clause, 42, 85, 181composition operator, 223

goal dependentanalysis, 402framework, 417information, 330

goal directed abductive proof procedure, 512goal directed bottom-up evaluation, 381

of logic programs, 455goal independence, 402

at run time, 301goal

independent semantics, 480optimization, 374

goal orientedbottom-up evaluation, 386query evaluation, 458

goal reduction, 59, 118process, 118

goalreplacement, 497replacements, 497size complexity measure, 3

Golog, 388Gottlob, G, 492GPPE, 461grammar, 14, 55, 139, 208, 320, 332, 358, 370

formalism, 332manipulation, 14rule, 14, 55, 139transformation, 14with context sensitive information, 370

granularity control, 384graph, 15, 85, 277, 303, 453

based interpreter, 65coloring, 116reduction algorithm, 13rewriting, 65, 460semantics, 192traversal, 15, 151

graphicalcollapsing technique, 88debugger, 88formalism, 152interface, 337tracing, 88

graphics workstation, 88greatest fixed point, 38

characterization, 81


greatestfixpoint, 47model of a program, 29

Green, 517Green, Cordell, 77ground, 166, 203, 238, 394, 514

answer, 159atom, 145, 187, 248binding, 160case, 90clause, 173completeness, 177deductive database, 393fact, 238goal, 187Horn clause, 90instance, 83literal, 5negative literal, 458operational semantics, 189query, 509

grounding, 439groundness, 159

analysis, 330, 348, 482, 522dependency, 463formula, 159inference, 311information, 311

group, 369of interconnected processors, 357

guard construct, 104guarded clause, 104

program, 104Guerrini, G, 492Gupta, 241

HH-Prolog system, 16halting

criteria for partial deduction, 227point, 227

Hamiltonian path, 442handling of context, 326Hansson, 2Hansson and Tärnlund, 2hardness, 489hardware

design, 116for high performance Prolog, 406

hare and tortoise, 205harmonizing chorales, 119Harrop formula, 239, 452, 468hash

function, 201memory, 16

HCLP, 236scheme, 236

head cycle free program, 508heap, 106

usage, 380heavy traffic in a network, 357Herbrand base, 40, 94, 128

of a logic program, 128Herbrand

domain, 221, 439interpretation, 40, 266, 383

Herbrand model, 83, 101, 127, 175, 266, 302, 408, 472theoretic semantics, 431

Herbrandstructure, 447unification, 523

Herbrand universe, 237, 350, 408with variables, 67

hereditary Harrop formula, 239, 452, 468heterogeneous, 17, 492, 494, 504

active agents, 504information system, 490SLD resolution, 17system, 492

heuristicalgorithms, 453evaluation, 16knowledge, 25

heuristics, 16, 30, 119, 215, 430hierarchic database, 31hierarchical, 224

closed world assumption, 213constraint logic programming, 236construction, 454logic program, 213planner, 517program, 213, 224representation of legal knowledge, 254structure scheduler, 384

hierarchically structured program, 172hierarchy, 213, 236, 247, 379

theorem, 64high degree

of accuracy, 193of overlapping, 455

high levelaction language, 392HTML, 459language, 392, 470program, 361programming language, 380transformation, 186

high performance, 215compiler, 303Prolog execution, 406


higher levelof abstraction, 388rule, 254

higher orderDCG, 358logic programming, 219predicate, 88Prolog, 51resolution, 51specification, 208syntax, 219term, 326unification, 51

HiLog, 219, 253program, 253

historicaldatabase, 171query, 327

history of a computation, 136Hoare logic, 465Höhfeld, 233Höhfeld and Smolka, 233homogeneous, 385homogeneous form, 91

of Prolog programs, 91HOPE, 71, 175HOPE-like pattern, 175Horn, 5

axioms, 35Horn basis, 411

of a set of clauses, 411Horn clause, 9, 21, 51, 65, 69, 70, 71, 76, 79, 90,

103, 150, 181, 239, 272based programming, 148compilation problem, 170

Horn clause logic, 2, 54, 76, 79program, 160, 251programming, 67, 76

Horn clauseprogram, 64, 151, 170, 359proof procedure, 65query, 21rule, 40theory, 83, 130type, 157with a rewrite rule, 9with equality, 90

Horndata, 35database, 5, 31definite database, 5formula, 15, 65, 124, 143, 468oriented equational clause, 9program, 63, 128, 185

proposition, 15renamable, 411SAT, 103set, 138

Hornlog, 65host machine description, 361Hsiang system, 179HTML frame based navigation, 459hybrid, 407

design, 115hybrid probabilistic

logic programming language, 501program, 501

hyperarithmetic, 282hyperresolution, 383hypertext lins, 430hypothesis, 260, 275, 375, 379, 400, 485

language, 275space, 485

hypotheticalaction, 375, 379deletion, 375implication, 19, 36

hypothetical insertion, 375of facts, 375

hypotheticaloccurrence of actions, 400query, 375

hypothetical reasoning, 229, 247, 260, 375, 512about updates, 307

hypotheticalrulebase with deletion, 375situation, 400

hypothetical state, 61of affairs, 396

hypothetical viewpoint, 229

IICL, 511ICS, 339ideal

in a lattice, 182refinement operator, 415

idempotent, 477identifying, 443

redexes, 92IDP, 215if clauses, 5iff

clauses, 5proof procedure, 407

ignorance, 304, 501test, 304

ill typed fact, 353


ILP, 275, 486, 487, 496program, 486system, 486techniques, 496

immediate consequence function, 101imperative

data structures, 504language, 367, 500programming, 322, 367tabular technique, 181

implementability, 460implementation, 406, 448, 470, 475, 476, 482, 504,

521details, 186

implementation ofagent programs, 504functional logic languages, 274ILP, 275logic languages, 271Parlog, 22Prolog, 141, 158

implementationproblem, 323techniques, 286, 499technology, 271

implementing DDAS, 371implication, 19, 93, 279, 316, 407, 413

goal, 279, 316, 323in goal, 323problem, 440

implicational query, 251implicit

definition, 497enumeration, 103indeterminism, 391parallelism, 336

imprecise, 417impure program, 489inclusion, 411inclusive disjunction, 416incomparable models, 148incomplete, 5, 42, 199, 343, 452, 493

cover set, 415data structure, 467database, 83, 426information, 42, 250, 496, 520initial knowledge base, 372knowledge, 260, 397, 473program, 260solver, 438specification, 176

incompleteness, 83, 314, 343, 359, 438, 440inconsistency, 39, 234, 351, 363inconsistent theory, 397incorrectness, 204

incrementalalgorithm, 234, 310, 393benefit, 367building of maps, 385compilation, 109description, 142enumeration, 475equational constraint solver, 306generalization of definite clauses, 484implementation of combinators, 442model of execution, 444problem, 218satisfiability problem, 218testing of constraint satisfiability, 234

indefinite, 65data, 35reasoning, 251

independence, 161, 501condition, 161

independence ofconstraints, 438literal scheduling, 438

independence property, 261independent

and-or-parallelism, 384and-parallel execution, 301

independent and-parallelism, 193, 301, 384, 453in logic programs, 301

independent choice, 511logic, 511

independent goals, 336indeterminism reasoning, 391index data type, 505indexed

grammar, 255language, 320

indexing, 141, 303, 448by structural properties, 377clauses, 222code, 109, 222method, 141

indirect recursivity problem, 157induction, 396, 428, 485

of logic programs, 485principle, 327, 428

inductiveconcept learning, 487entailment, 327extension, 428inference, 275, 496

inductive logicprogram, 427programming, 275, 415, 484, 486, 487, 488, 489,

496inductive reasoning, 445


inductive synthesis, 136, 269, 496of recursive logic programs, 496

inequality, 486inequation, 37, 129, 346inference, 267, 275, 318, 375, 379

engine, 418method, 138of negated ground atoms, 187procedure, 488rule, 51, 87, 129, 275, 308, 373, 407system, 129, 370

inferencing method, 354inferred mode information, 109infinite

backtracking, 38branch, 71chain, 476computation, 24, 32, 81cover set, 415data structure, 52, 68, 175derivation, 187, 224failure, 331loop, 138, 203object, 81phenomena, 312recursion, 59, 114

infinite set, 144, 447of and-trees, 144of binary clauses, 476

infinitestate system, 162substitution, 4term, 28tree, 14, 326

infinitely many unifiers, 187inflationary semantics, 424information compression, 275information integration, 494

system, 494information

ordering, 353passing strategy, 150processing, 385seeking dialogue, 318source, 494

information system, 490, 491management, 492

inherent complexity, 482inherently

imprecise, 417nondecomposable, 309nonmonotonic, 333

inheritance, 49based system, 229hierarchy, 333

initialknowledge base, 372program, 226query, 407state, 388

initiality, 177initialization rule, 329input

argument, 84, 467clause, 138data, 474database, 329

input-outputexample, 496specification, 102

insertion, 307, 375, 448instantiation, 314

of logical variables, 115state, 314

institutions, 469instruction

cache, 97folding, 365set, 97, 196

instrumentation, 503integer

constraint, 401, 505data type, 505periodicity constraint, 423

integratedcircuit design, 341language, 274set of system predicates, 404system, 354

integratingactive and deductive rules, 492knowledge from multiple sources, 351objects and relations, 376

integration, 270of constraint solving into abductive reasoning,

515integration of functions into logic programming, 274

languages, 314integration of

geographical information systems, 491objects and relations, 376

integration system, 494integrity

check, 427checking, 427

integrity constraint, 12, 26, 33, 41, 74, 202, 327, 407,427, 512, 516

checking, 33, 74, 337handling, 33


integrity maintenance, 202intelligent agent, 400intelligent backtracking, 17, 60, 82, 119, 146

scheme, 82intelligent

behaviour, 430control, 99data retrieval in Prolog, 340problem solving, 8query answering, 69software agent, 388

intended model, 378intensional

first order language, 197Herbrand model, 197interpretation, 197logic, 197

intensional logic program, 197clause, 197

intensional logic programming, 197language, 197system, 197

intensional operator, 197definition, 197

intensional set former, 350intensionally defined atom, 307interaction, 444interactive configuration, 339

by selection, 339interactive

graphics, 236multicriteria optimization problem, 444ordering, 115querying, 338theorem prover, 51, 428

interargument relation, 267intermediate code, 109, 361

translator, 361intermediate logic, 449Internet Explorer, 459interoperability, 405interpolating general logic programs, 426interpolation, 426interpretation, 37, 94, 266, 356

of a deductive system, 321of a SDG, 332

update, 373, 507interpreter, 9, 22, 55, 59, 71, 72, 84, 178, 205, 211,

231, 236, 307, 388, 455, 476interpreting, 76, 279, 316, 391interprocedural, 500

analysis, 192, 500register allocation, 470

interprocessor communication, 183, 384interruptable query answering, 351

intersecting types, 199intersection of models, 473intersections of relations, 401interval

arithmetic, 401computation, 235consistency, 442

interval narrowing, 235algorithm, 443

interval of rational numbers, 479intractability, 99, 244intractable, 99, 489, 521intraprocedural

backward accumulation, 500forward accumulation, 500

intuitionisticassumption, 459circumscription, 251deductive database, 379logic, 31, 36, 76, 79, 93, 251, 375, 379, 449propositional calculus, 134validity, 449

intuitionistically, 79complete, 449

intuition, 267invariance properties, 189invariant, 499invention, 275inverse resolution operator, 484inversion of SLD-resolution, 484invocation, 322irrelevant

example, 487literal, 487

IS-A taxonomy, 49Isabelle, 51isomorphic, 353isomorphy, 382iterated fixed point semantics, 94

JJaffar, 101, 233, 438Jaffar and Lassez, 233, 438Jaffar and Stuckey, 101jc system, 362join, 69, 246Jones, 209Jones and Mycroft, 209jump, 222

KK (modal logic), 57, 179K.B., 179Kanellakis, 98Kanji, 338


Katsuno, 373Katsuno and Mendelzon, 373kernel, 22

PARLOG, 22key word in context, 6keyword, 261KFOPCE, 202Khamsi et al., 472Khoshafian, 424Kifer, 253KL1, 361

program, 361Kleene, 38, 156, 331, 429

logic based semantics, 190strong three-valued logic, 429three-valued logic, 38

Kluzniak, Felix, 62knapsack problem, 181KNET, 115knowledge, 373

acquisition, 275, 496base, 69, 119, 132, 252, 351, 372, 507, 512based techniques, 339compilation, 488discovery, 496of the world, 507ordering, 246

knowledge representation, 169, 247, 265, 446, 450,473, 507

in artificial intelligence, 265knowledge system, 307Knuth Bendix

algorithm, 179type completion, 203

Kowalski, 76, 125, 331, 355, 514KRC, 71Kripke, 38, 93, 156, 239, 331, 429Kripke Kleene fixed point semantics, 429Kripke Kleene semantics, 38, 331

for logic programs, 38Kripke Kleene three-valued semantics, 156Kripke

like model, 93, 239model, 251

Kriwaczek, F, 36Krom formula, 64Kunen, 245, 259, 374, 429

semantics, 190, 245, 304, 343Kursawe, 231KWIC, 6

LL-semantics, 353L1 language, 400labeled transition system, 118

LAM, 410

LAM12 emulator, 410

lambda-calculus, 13λ-calculus, 358λ-term, 468λ Prolog, 326, 468language, 8, 9, 11, 22, 23, 49, 63, 71, 93, 105, 112,

118, 148, 169, 172, 175, 187, 206, 223, 233,236, 247, 258, 265, 270, 274, 275, 283, 307,350, 354, 356, 358, 362, 373, 375, 376, 379,380, 388, 392, 397, 399, 400, 401, 404, 419,421, 429, 430, 431, 441, 442, 446, 466, 470,491, 492, 494, 501, 504, 508, 512, 523

acceptance, 208analysis, 208BABEL, 175construct, 148coverage, 459expressiveness, 49for programming in logic with finite sets, 350for updating logic programs, 307

language independence, 302language independent

program, 302stratified normal object program, 302

languagelevel, 505of definite logic programs, 265of extended logic programs, 426of hereditary Harrop formulas, 452processing, 276semantics, 285translation framework, 365

largecombinatorial problem, 116complex system, 117

Lassez, 24, 190, 233, 438Lassez and Maher, 24last call optimization, 180, 257lattice, 128, 351

theoretic argument, 281law, 400layered mode, 467layering, 148lazy enumeration of sets, 475lazy evaluation, 50, 52, 208, 486

for lists, 52in logic, 52

lazynarrowing, 92, 460reduction semantics, 175surderivation, 68

LCF, 51LDL, 148, 170, 283, 349, 431


lean deduction, 364leanTAP, 364learning, 487, 488

recursive definitions, 485least fixed point, 38least fixpoint, 37, 128, 383, 469

of the inference function, 37least Herbrand model, 175, 187, 228, 353, 497, 509

of a program, 353semantics, 226, 497, 498

least model, 469criterion, 120

least term model, 353least upper bound, 348

operator, 425left linear

1-rule component, 309form, 309

leftrecursion, 14, 139termination, 428to right atom scheduling rule, 394

legalinterpretation principle, 254knowledge, 254rule, 254

legislation, 396length

complexity measure, 3of a refutation, 240

levelmapping, 267of failure, 29of knowledge, 8of metaprogramming, 254

Levesque, 202language KFOPCE, 202

lex specialis legi generali derogat, 254lexical visibility rule, 279, 316lexicalized context free grammar, 321lexically scoped, 66lexicographical priority, 352LIFE, 233Lifschitz, 35, 304, 331, 392, 397, 399, 416, 461lifting, 221, 425limitations in implementation, 285Linda, 459

style coordination, 459linear constraint, 234

solving, 234linear

control algorithm, 157decomposition, 309equation, 346growth, 485

logic, 167, 445negation, 167object, 466real constraint, 479recursion, 207, 377rule, 329rulebase, 379sequence of 1-rule programs, 309speedup, 146theory, 167

linear time, 15, 103, 124, 411algorithm, 15, 65, 124

linearity, 379linearization process, 453linearly

bounded, 138, 157decidable, 149ordered, 379recursive predicate, 151related, 3

linguistic theory, 276LInt (domain), 479LINUS, 487

transformation approach, 487LIPS, 97LISP, 71

dialect, 66LISPKIT LISP, 71list constructor cons, 447literal, 15, 78, 82, 99, 146, 167, 239, 487, 521

reduction, 487liveness property, 223LL(1) requiremen, 14Lloyd, 110, 166, 227, 498Lloyd and Shepherdson, 227Lloyd Shepherdson framework, 498Lloyd, J W, 34, 456load

balancing, 100, 357imbalance, 357sharing, 183, 357

Lobo, J, 461local

blackboard, 459clause, 279, 316confluence, 179control, 498data buffer, 158delay selection rule, 464leftmost, 336

local memory, 158design, 158

localsuspension free, 356variable, 16, 199, 267


localisation of the CWA, 239locally finite, 415locally stratified, 184, 281

program, 217, 280, 317log-space complete for P, 4logarithmic work space, 481logic, 36, 51, 156, 182, 219, 233, 405, 420, 449logic based

configuration, 115configurator, 115heterogeneous information systems, 490language, 148

logiccontinuation, 66data language, 170

logic database, 33, 151, 212, 337language, 148

logic forknowledge representation, 473reasoning about, 202

logic grammar, 208, 326, 430formalism, 208, 320, 321, 332implementation, 55system, 320

logic language, 9, 271, 272, 430, 462, 500LDL++, 349with built-in equality, 9

logicof MBNF, 416progamming module, 58

logic program, 3, 11, 16, 18, 21, 24, 28, 29, 30, 32,33, 34, 37, 38, 45, 47, 63, 65, 71, 75, 84, 87,92, 94, 99, 101, 107, 110, 120, 127, 144, 145,146, 152, 154, 160, 162, 165, 184, 189, 193,194, 199, 203, 206, 210, 212, 214, 221, 226,228, 229, 230, 241, 245, 246, 247, 250, 252,254, 255, 258, 260, 265, 267, 268, 269, 277,278, 302, 304, 308, 312, 313, 314, 330, 345,353, 355, 357, 372, 377, 386, 389, 392, 395,396, 397, 402, 409, 420, 425, 426, 427, 428,429, 430, 438, 440, 451, 452, 453, 462, 464,465, 467, 471, 475, 476, 477, 481, 485, 495,496, 497, 507, 509, 519, 522, 523

analysis, 270, 417compilation, 195computation, 154failure, 29fragment, 469module, 507observable, 509semantics, 509specification, 38synthesis, 269theorem prover, 428with delay declarations, 464

with equality, 11, 120, 359with negation, 335, 354

logic program with negation as failure, 416, 420in the head, 416

logic programming, 6, 8, 10, 11, 12, 20, 28, 31, 40,51, 53, 54, 56, 58, 60, 61, 64, 66, 67, 68, 71,72, 76, 77, 81, 87, 88, 93, 97, 110, 112, 114,116, 118, 124, 125, 134, 142, 147, 153, 156,161, 169, 173, 175, 181, 182, 187, 197, 206,208, 219, 223, 229, 233, 235, 236, 237, 240,243, 244, 247, 261, 263, 264, 265, 269, 270,272, 273, 274, 276, 283, 284, 304, 307, 319,323, 325, 326, 327, 333, 341, 347, 355, 364,367, 373, 376, 382, 389, 392, 395, 399, 408,420, 421, 430, 439, 443, 447, 448, 451, 463,467, 472, 473, 475, 478, 480, 498, 501, 502,507, 510, 512, 513, 516, 517, 523

approximation, 400based default reasoning, 502based language, 431calculus, 2environment, 122, 270framework, 354implementation, 367inference mechanism, 399interpreter, 60, 80

logic programming language, 7, 49, 63, 68, 80, 119,125, 231, 235, 250, 257, 270, 279, 283, 326,362, 364, 369, 375, 388, 394, 417, 446, 468,470, 475, 512

with equality, 68logic programming

paradigm, 50, 90, 216, 391, 509semantics, 247, 461situation calculus, 372specification, 181system, 336, 368, 470technique, 276, 341with equality, 129with equations, 71, 155with functions and predicates, 175with inheritance and true negation, 333with negation, 110

logic query, 152implementation, 152

logicspecification, 71theory, 491

logic variable, 66, 323binding, 66

logic with negation, 375logical

analysis, 93clock, 118connective, 272, 421


logical consequence, 71, 129, 140, 235, 314, 383,440, 447, 473

semantics for logic programs, 447logical

constraint, 275data structure, 261, 319database paradigm, 202deduction, 2environment, 492equation, 137form, 42, 112formalism for logic programming, 421foundation for logic programming, 420, 421foundations, 36framework, 379handling of context, 326implication, 24inference, 97interpretation, 429

logical language, 93, 492with blocks and modules, 279, 316

logicallevel, 8methodology for testing, 117point of view, 440program, 52properties of N-Prolog, 36reconstruction of Prolog II, 7

logical semantics, 130, 261, 375, 438, 447for CLP languages, 394

logicalsimplification, 407soundness and completeness results, 394specification, 517switch, 505syntax, 51system, 200theory, 415, 447update language, 492variable, 10, 52, 86, 123

LogicWeb, 430language, 430

LogiMOO, 459LOGIN, 49Logix, 100, 105

system, 145long distance dependency, 276

between constituents, 276looking ahead inference rule, 235lookup, 448

strategy, 338loop, 59, 217, 310, 331, 499

absorption, 230check, 227

loop checking, 217, 227mechanisms, 217technique, 306

loopdetection, 59, 204, 249, 267handling, 249parallelization, 322

looping, 139problem, 139

loosely coupled parallel platforms, 357losing information gracefully, 377loss

of information, 189of parallelism, 453of precision, 402, 417

Loveland, 103, 168low level

optimization, 186, 362representation of data objects, 380

low Risc machine, 97lower bound, 4, 240LP, 152, 318

(logic program), 152language, 267

LPTP, 428LPwNF, 502LR

parser, 370parsing, 370

LSign (domain), 479lub, 457LUST resolution, 128

Mm-in-n coding, 141M-semantics, 509machine

code, 231independent microprogramming language, 341instruction set, 105learning, 95synthesis of mathematical theorems, 137

machinery of the WAM, 475macro expansion, 97macro-expanded RISC code, 97magic predicate, 160magic set, 160, 164, 212, 312, 386, 455

algorithm, 150, 160approach, 164method, 152program, 455query rewriting technique, 160technique, 253transformation, 164, 330, 402, 455


magic templates, 160, 212, 238algorithm, 258evaluation, 238transformation, 238

magictransformation, 258wand, 330

Maher, 24maintainability, 361maintenance, 341managing data and knowledge, 492manipulating

data, 405schema, 405

Manna, 197Marek, 304, 372, 373Marek and Truszczynski, 372, 373Marriott, 190, 479Marriott and Stuckey, 479Marriott Naish Lassez singleton abstraction, 190Martin-Löf constructive type theory, 51massively parallel, 418

computer, 418SIMD computer, 418

matching, 180, 222, 349of bounded set terms, 349operation, 180procedure, 358

mathematical, 320definition, 162induction, 327notation, 505result, 324semantics, 178, 261system, 63

mathematics, 156matrix

chain product, 181equation, 85

Maxflow, 48maxima, 451maximal

parallelism, 453query plan, 493safe computation rule, 140set of answers, 493validity interval, 452

maximalism intuition, 355maximum number, 451

of stable models, 451MCC and-parallel analyzer and annotator, 195McCarthy circumscription, 35McClay, 340McCord, 55

meaning ofa program, 221formulas, 197LIFE, 233

measure of complexity, 18measurement, 100, 158mechanical

theorem proving, 60transformation, 358

mechanism, 33, 223, 249, 362mechanizable approach, 409mediated schema, 493MedLan, 491meet, 246Mellish, 84

abstract interpretation, 212memo table, 475memoing

device, 184techniques, 377

memoization, 212, 475memory, 16, 384, 470, 506

coherence, 506coherency, 506reference, 86, 470referencing characteristic, 158trace driven simulator, 158usage, 16utilization, 410

Mendelzon, 373Mercury, 369

compiler, 369message passing, 48

primitive, 223meta-agent program, 504meta-argument, 96meta-expressions, 505meta-interpreter, 96, 118, 120, 302, 377, 427, 445,

455, 509in logic programming, 427

metagrammar extension, 55metalanguage, 8, 19

for CLP(R), 404metalevel, 33

computation, 254description, 430extension of Prolog, 414facility, 414interpreter, 234object, 414

metalogic programming language, 254metalogical control, 32metamorphosis grammar, 208metaphor, 321metaprogram, 302


metaprogramming, 254, 404, 509in CLP(R), 404in logic, 254

MetaProlog, 414language, 414

metareasoning, 265, 504metarestriction grammar, 55metarule, 55metatheory, 130, 197method for implementing logic queries, 152methodology, 104, 462

for program development, 268for testing, 117

metricmethod, 281technique, 281

microprocessor, 406migration, 357Miller, 239Miller et al., 239Milner CCS, 223MIMD implementation, 368MIMOLA, 341

hardware design system, 341minimal consequence, 126

relation, 126minimal

fixpoint, 40function graph semantics, 192Herbrand model, 383infinite object, 81length of a refutation of a goal, 240

minimal model, 148, 278, 315, 520reasoning, 383

minimal model semantics, 58, 128, 387, 393for logic programming modules, 58

minimalmodel state, 383partial temporal logic, 478S-model semantics, 228set, 406solution, 413

minimalism intuition, 355minimality

in disjunctive databases, 308of answer sets, 416

minimum model, 114Minker generalized closed world assumption, 128Minker, J, 128, 461MIPS RISC architecture, 367MIRANDA, 175Mishra, 209miss ratio statistic, 158missing car example, 396missing information, 156

mixed integer programming, 393mixfix syntax, 178mixing of real numbers, integers, and Booleans, 401mixture, 97ML module system, 172Mockingbird, 117modal, 179, 279

approach, 316framework, 452logic, 36, 57, 171, 279, 316, 452operator, 265, 452propositional logic, 179sentence, 202theory, 243

mode, 462, 467mode inference, 84

algorithm, 84system, 195

modeinferencing, 144information, 84of a predicate, 84system, 467

modelbased reasoning technique, 446class, 469for a logic program, 32, 281generation, 344, 383inference algorithm, 415of a program, 378of inductive synthesis, 136of parallel computation, 98of parallelism, 193of the World Wide Web, 430selection, 216semantics, 513

model theoretic, 333, 335, 454, 471, 511issue, 264semantics, 9, 197, 203, 223, 236, 354, 405, 431,

469, 471view, 395viewpoint, 266

model theory, 78, 93, 182, 375, 460, 501for ILP, 275

model tree data structure, 315modeling, 162, 486, 505, 509

languages, 505simultaneous events, 114

moderate reasoning, 520modular, 247, 454

approach, 397compilation, 365composition, 208


modular logicprogram, 469programming, 58, 219, 272

modular program, 172development, 465

modularprogramming, 509Prolog program, 172proof, 456unit, 469

modularity, 172, 281, 454, 515in logic programming, 272

modularization, 507modularly stratified program, 253, 381module, 10, 20, 93, 118, 206, 279, 316, 507

composition, 507expression, 178for logic programming, 20in logic programming, 93language, 172system, 105, 272

Moerkotte, G, 492molecule, 410Monaco

intermediate abstract machine, 361project, 361

monocopy list, 16monomorphic

analyses, 425type analysis, 425

monotone operator, 38monotonic, 469, 475

aggregation, 475closure operator, 128inference, 157logical system, 421memo table, 475semantics, 469

monotonicity, 197monovariant method, 360Monteiro, 223Montesi, D, 492Moore autoepistemic logic, 304mortality problem of Turing machines, 329moving constraints towards the end of a clause, 479Ms, 195MSS, 341multi-algebra, 177MULTI-OLDT, 351multi-SLD-resolution, 368multicriteria optimization, 505multidatabase system, 405multidirectional nature, 479multiheaded guarded rule, 441multilayered, 254

multilevelmetalogic, 254model of legal knowledge, 254problem solver, 8

multilingual interface, 459MultiLog, 368multimedia support, 459multimethod approach, 376multimethods, 376multiple

concurrent binding environments, 368inheritance, 363knowledge bases, 351linear regression, 486register set, 158relational databases, 405specialization, 192, 499substitutions, 368

multiplicity, 462information, 479

multiply intersecting strokes, 338multiprocessor, 123, 418multisequential approach, 384multithreaded blackboard based logic programming

system, 459multivalued

fixed point theorem, 472logic programming, 182

musical knowledge, 119mutagenic activity, 486mutual

exclusion, 501recursion, 267, 409

Mycroft, 209

Nn-ary function symbols, 312N-Prolog, 19, 36, 168

computation, 36NAF, 239, 429

rule, 239Naish, 190naming convention, 254narrative based ontology, 397narrowing, 50, 92, 175, 208, 306, 401

algorithm, 401function, 401grammar, 208intervals, 235step, 92technique, 129, 443

native code, 158, 365natural

constraint language, 505deduction, 51


natural extension, 481natural language, 38, 53, 54, 208, 320, 358, 459

analysis, 54, 445, 459constructs, 459control, 459parsing, 130processing, 276, 319semantics, 56sentence, 56

naturalnumbers, 214, 442query language front end, 358recursive formulation, 181semantics, 156

naturals, 401NCL, 505NDB-PTIME, 335, 419near-Horn Prolog, 168Nebel prioritized base revision, 512necessity link, 468negated

atom, 187, 449head, 333

negation, 24, 39, 44, 76, 79, 93, 94, 122, 128, 129,148, 184, 217, 226, 247, 250, 260, 264, 265,304, 308, 328, 374, 381, 394, 428, 458, 471,473, 478, 509, 521

negation as failure, 5, 31, 36, 39, 44, 72, 87, 94, 108,114, 126, 202, 239, 250, 251, 260, 304, 331,344, 375, 378, 379, 391, 416, 420, 421, 429,502, 511, 514

inference rule, 5operator, 389rule, 11, 12, 29, 31, 37, 45, 94, 187

negationas finite failure, 343as inconsistency, 39

negation by failure, 429semantics, 65

negationin clause bodies, 350in disjunctive databases, 308in goals, 350in HiLog, 253

negation in logicprogramming, 72, 121programs, 264, 439

negationof equality, 129of Horn clauses, 65

negativebody literal, 164clause, 42constraint, 261, 439cycle free condition, 127

dependency, 310Horn clause, 65hypothesis, 344information, 42, 122, 187, 213, 221, 308, 507literal, 37, 101, 217, 253, 310, 355, 458loop, 310nonground literals, 429recursion, 412

negative subgoal, 94, 163, 184with free variables, 163

neighborhood semantics, 197nested, 431

data models, 283relational model, 431relations, 431sets, 431structure, 363tuples, 431

nesting, 350, 424Netscape, 459network contention, 357network

of communicating processes, 52of processors, 201of transputers, 384

neural network, 486Newman lemma, 179nitroaromatic molecule, 486NLP system, 276node, 18, 55, 88, 94, 205, 241, 277, 506Noetherian system, 179non-Herbrand interpretation, 473non-Horn

clause, 215database, 308form, 157formula, 143reasoning, 168

non-structure-sharing representation, 80nonapproximatability, 489nonascending unfold/fold proof, 497nonconfluent, 177

semantics, 356term rewriting, 177

noncontrapositive, 392nonconvex relation, 401noncyclic queries, 152nondeterminism, 52, 104, 335, 484nondeterministic

action, 391algebraic specification, 177choice, 419computation, 185derivation step, 418extension of logic database languages, 419


nondeterministicfixpoint semantics, 335function, 460lazy function, 460linear space, 3operations, 177polynomial time query, 335problem, 419semantics, 508SLDNF evaluation, 167time polynomial query, 419

nonempty set of residuations, 314nonexecutable theory, 178nonfloundering, 41

functor free programs, 412of query evaluation, 41program, 381query, 184, 343

nongroundabductive atom, 413continuous finitary version of the Fitting

operator, 374fact, 160logic program, 393

nonground negativegoal, 121literal, 458

nongroundnormal logic program, 521representation, 302term, 160

nonlinear, 442constraint, 346

nonlogical, 78nonmonotonic, 313

completion, 420consequence relation, 126extension of logic programming, 439formalism, 244

nonmonotonic inference, 449relation, 449task, 244

nonmonotonicknowledge base, 507logic, 244mode of negation, 351problem, 247query, 375

nonmonotonic reasoning, 243, 247, 265, 334, 354,420, 421, 439, 452, 507, 512, 514, 521

problem, 247nonmonotonic system, 305nonmonotonicity, 389nonprimitive constraint, 442nonprocedural, 132

nonrecursivedefinition, 149hypothesis, 485, 496program, 165

nonredundant, 201computation, 201

nonrefutational, 129nonsharable programs, 183nonstandard, 324

constraint solver, 441semantics, 190, 324

nonstrict independence, 301nonterminal relation symbol, 21nonterminals, 15nonterminating, 81nonterminating computation, 81, 197, 331

loop, 211nonterminating logic program, 81nonunifiability, 60norm, 267normal

alternating fixpoints, 305clause, 387CLP program, 374constraint logic program, 374database, 159disjunctive programs, 387, 416

normal formproperty, 439theorem, 18

normal goal, 108, 161, 224, 252normal logic program, 190, 210, 248, 305, 313, 378,

387, 469, 516with integrity constraints, 516

normalopen logic program, 473program, 161, 224, 248, 252, 253, 461

normalizing an OSF term, 363notational primitive, 169noun

modifier, 55phrase, 56

NP, 379NP-complete, 99, 218, 342NP-completeness, 169, 335NP-hard, 149NU-narrowing, 208number of

matchers, 349nodes, 18

numericalalgorithm, 85analysis, 486derivative, 486methods, 85reasoning, 486


OOaSiS system, 337OBELICS, 339OBJ, 178Obj-U-Datalog, 492object

broker, 459language, 8, 502

object levellogical connective, 272variable, 302

object orientedlibrary, 340logic language, 376programming, 233

object program, 96, 302observable, 266observation, 400observing, 400occur check, 86, 256

problem, 86OL, 333

stable model, 333OLAP, 405OLD, 133OLDT resolution, 211, 212, 500

based query processing procedure, 351on-line

algorithm, 143analytical processing, 405

oncology clinic, 337ontology, 397open

block, 316completion of an open program, 454

open logicprogram, 473programming, 473

open problem, 26, 267, 318, 493open program, 454

with parameters, 454open

question, 457world assumption, 431

operating principles of an agent, 504operation on variables, 106operational behavior, 118

of logic programs, 302operational

behaviour, 462expressiveness, 442interpreter, 78meaning of a goa, 93model, 118, 209

operational semantics, 9, 58, 73, 178, 189, 203, 223,236, 257, 266, 274, 322, 343, 368, 374, 403,428, 429, 438, 454, 480, 500, 515

of concurrent constraint logic languages, 356of Prolog, 73

operational viewpoint, 450operations

of Prop, 348on modules, 58research, 116, 342

operator, 38, 272, 275, 383, 425, 461, 489, 501Opium, 466optimal

arc consistency algorithm, 442groundness analysis, 348matching algorithm, 349

optimal ordering, 489of the antecedents, 489

optimalprogram, 133solution, 442

optimality, 150, 348, 442of abstract operations, 348

optimization, 23, 84, 97, 109, 180, 186, 222, 241,328, 346, 362, 366, 374, 470, 479, 488

in Prolog compilers, 345optimization of

code, 186logic programs, 107

optimization technique, 107, 393optimized

code, 406unit clause, 97

optimizing, 387, 499bottom-up evaluation of constraint queries, 328compiler, 192, 361, 406, 479general chain program, 488implementation, 369model computation, 393

OR, 342or-and-parallel prolog, 123or-parallel execution, 106, 241, 418

algorithm, 100or-parallel Prolog, 100, 106, 506

system, 506or-parallel search, 368or-parallelism, 154, 241, 384, 418, 506or-under-and-parallelism, 384oracle, 377order

assertion, 277consistency condition, 127consistent programs, 280, 317of magnitude, 448sorted equational logic, 178


order sorted featureterm, 363theory unification, 363

ordersorted term rewriting, 178sortedness, 257

orderedbinary decision graph, 311clauses, 488

ordered logic, 333program, 333

orderedsearch, 381set of clauses, 415tree, 98

ordering, 246, 477, 489data, 452of a relation, 419of an n-rule theory, 489of events, 452

ordinary circumscription axiom, 251oriented equational clause, 9orthogonal, 257

memoing techniques, 377OSF term, 363OSF theory, 363

unification, 363outermost rewriting strategy, 208output argument, 84, 467overlapping information, 507overloading, 178owning object approach, 376

PP= NP, 489P left linear, 309P-linear, 309PAC-learning, 489packing, 442Padreschi, 281, 456pair sharing, 523

analysis, 523paired conjunctions, 55pairwise disjoint, 497paradigm, 180, 237, 439, 475, 507

of subset and relational logic programs, 475paradoxical sentence, 38parallel

algorithm, 4, 48, 98bottom-up processing, 201computation, 123computer, 98, 100demand driven search, 100

ECRC Prolog system, 123evaluation, 165, 183

parallel execution, 99, 154, 301, 357, 371, 384of logic programs, 154

parallelgoals, 301, 384implementation, 100, 123, 146logic language, 118

parallel logic program, 99evaluation, 165

parallel logic programming, 123, 142system, 336

parallelMaxflow algorithm, 48processes, 100processing, 138, 322processors, 15

parallel Prolog, 100, 104, 106system, 384

parallelproof procedure, 301semantics, 101, 105speedup, 100

parallel timebound, 4upper bound, 4

parallelism, 4, 43, 106, 134, 154, 193, 201, 322, 356,371, 384

parallelization, 183, 189, 322, 345, 453, 499process, 453scheme, 201

parallelizing, 453compiler, 499structural recursion in logic programs, 322

parameterization, 323parameterized, 324

modules, 10parameters in grammar rules, 55parametric, 93, 454

polymorphism, 257specifications, 454

parametrically correct, 454parametrization, 178parametrized component, 172PARK semantics, 492

for active rules, 492Parlog, 22, 100, 118, 142

program, 22Parma, 367

implementation, 367parse, 55

tree, 370parser, 14, 321, 370, 459

for context free grammars, 370generation, 14


parsingalgorithm, 321as deduction, 321coordinate conjunction, 55genes, 320problem, 139, 332procedure, 255process, 139strings, 14

partialcircumscription, 251computable function, 185correctness, 248, 353, 465

partial deduction, 226, 227, 228, 229, 230, 231, 252,382, 387, 498

method, 387of logic programs, 352

partial evaluation, 161, 189, 382, 427, 461, 498, 499property, 382, 461

partialevaluator, 161execution procedure, 358instantiation, 393interpretation, 38model, 76, 79order, 189, 475set term, 431

partial solution, 384, 413to clause bodies, 455

partial stable model, 210, 313semantics, 305

partialstable semantics, 383temporal logic, 478translation, 365

partially instantiated proof, 414Pascal, 303passing of messages, 384Pat(Prop), 311path, 152, 192, 205

in a U-graph, 277pattern, 112, 119, 208, 330pattern matching, 338

procedure, 54PDH, 520PDP, 384pebbling, 15

a graph, 15PEPSys, 123

abstract machine, 123perception, 285Pereira et al., 318Pereira, L, 439PERFECT, 382

perfect Herbrand model, 302perfect model, 164, 315

for a disjunctive theory, 315semantics, 226, 315, 375, 383

perfect theory, 489performance, 361

analysis, 418, 475data, 195

periodic constraint, 423periodicity constraint, 423permissible database query, 202persistence, 142Petri net, 223Phan Minh Dung, 210PHIER, 379philosophy, 117physical world, 444�0

1 class, 282

�02, 126

�11, 408

complete, 408definable, 408

Pick, G, 504picture of program executions, 466PL0 language, 409Plaisted, 168plan, 493planning, 130, 236, 327, 375, 379, 400, 517

algorithm, 517as theorem proving, 517level, 8module, 00problems, 327

polymorphicabstract interpretation, 425analysis, 425description, 425order sorted resolution, 257

polymorphic type, 425analysis, 425

polymorphism, 257polynomial, 133

groundness analysis, 522number, 489

polynomial time, 57, 133, 207algorithm, 489data complexity, 335hierarchy, 379query, 508

polynomially solvable satisfiability problems, 143polyvariant detection, 360POPLOG Prolog compiler, 23Pos

(domain), 522analyser, 482


Posanalysis, 522based abstract interpretation, 482

poset of abstract properties, 189positive

body literal, 164Boolean function, 482, 522clause, 128constraint, 261deppendency, 310disjunctive program, 387, 416existential query, 21Horn clause, 93hypothesis, 344literal, 307logic program, 101, 266program, 217, 227, 382, 412, 420recursion, 412subgoal, 94

positivistic computation rule, 412possible

model semantics, 513values of program variables, 191

possible worlds, 511semantics, 197, 511

Post correspondence problem, 347postassertion, 277power of

a language, 59assert, 173retract, 173rule based query language, 283

power set, 128, 283practical implementation, 517PRAM, 4pre-assertion, 277precision, 84, 500, 522

loss, 417of an analysis, 519of relational analyses, 500

precompilation, 427precondition, 388predicate, 84, 99, 106, 107, 114, 121, 159, 160, 203,

219, 222, 256, 275, 283, 303, 329, 335, 336,350, 360, 376, 407, 428, 467, 485, 497, 499

boundedness, 329calculus, 32, 61, 219, 405completion, 35execution, 474

predicate logic, 10, 219program, 282

predicatesubstitutivity axiom, 91symbol, 120, 485type, 199

predicates in DatalognS, 312prediction, 486predictor variable, 486preference, 236

criterion, 378preferential

constraint, 236semantics, 305

preferredextension, 210, 313semantics, 520

prefix elimination method, 488prescribed cut, 209prescriptive specification, 209presentation, 137preservation, 253

under extension, 253prime number program, 27primitive, 30, 233

event, 501recursive function, 224test instruction, 109

principleof lean deduction, 364of minimality, 416

prioritized circumscription, 251, 315priority relation, 502PRIZ, 133

programming system, 134probabilistic logic, 501

programming, 501probabilistic

strategy, 501support, 275valued logic, 156

probability, 511of a compound event, 501

problemdomain, 8, 395, 473solver, 446

problem solving, 8, 139method for ICS, 339program, 8

problem specification, 132procedural, 387, 461

interpretation, 125language, 116, 442part, 236program, 25semantics, 68, 161, 184, 187, 209, 249, 310, 507tree manipulation program, 25

procedurecalling, 105oriented language, 105


processinterpretation, 154model, 154oriented language, 105queue, 105schedulings, 356spawning, 105

ProCoS, 409production, 278

rule, 139, 157system, 139

program, 8, 9, 12, 23, 37, 47, 52, 84, 90, 93, 94, 100,101, 107, 114, 142, 146, 148, 150, 172, 182,183, 184, 199, 221, 222, 226, 229, 230, 236,239, 249, 253, 256, 267, 272, 278, 302, 303,307, 308, 309, 311, 312, 314, 328, 330, 334,343, 347, 353, 357, 362, 369, 370, 371, 374,377, 381, 382, 386, 388, 394, 395, 404, 410,416, 429, 430, 439, 440, 451, 454, 456, 464,465, 467, 469, 474, 475, 478, 479, 481, 482,498, 499, 501, 505, 509, 521, 522

program analysis, 266, 270, 356, 417, 477, 519of languages with procedures, 500

programbounded by recursive level mappings, 509boundedness, 329characteristic, 46classification, 183clause, 323, 389, 475completion in three-valued logic, 343

program correctness, 454proof, 189

programdebugging, 466decomposability, 165defined goal, 237derivation methodology, 230development, 109, 268efficiency, 23, 230equivalence, 266execution, 94, 99, 314, 466fragment, 180instrumentation, 503interpretation, 221module, 507mutation, 270optimization, 84parallelization, 499pattern, 347predicate, 499property, 189semantics, 38, 509sharing, 410specialization, 228, 497, 498, 499state, 142, 500

synthesis, 95, 132, 133, 228, 269, 497testing, 509

program transformation, 63, 85, 189, 266, 344, 347,360, 377, 488, 497, 498, 513, 519

methodology, 230technique, 231

programupdate, 507variable, 191, 194, 523with arithmetic, 353with declared types, 199with equality, 91with fixed modes, 370with negation, 381, 471with ordered clauses, 488

programmable, 350, 466microprocessor, 341

programmingassistant, 275environment, 96, 105, 142, 270example, 175, 450, 460

programming language, 9, 10, 118, 125, 175, 223,233, 254, 270, 279, 316, 503

Prolog, 63programming

paradigm, 233, 272, 285style, 141system, 125, 142tool, 142with equalities, 178

programming-in-the-large, 272programming-in-the-small, 272programs as theories, 460projection, 69, 457Prolog, 6, 7, 9, 10, 12, 19, 27, 39, 42, 43, 46, 48, 49,

51, 52, 54, 59, 62, 63, 71, 72, 78, 82, 86, 88,91, 93, 95, 96, 97, 100, 104, 109, 114, 115,116, 119, 120, 125, 140, 141, 158, 167, 168,172, 175, 180, 186, 193, 196, 202, 203, 204,206, 208, 209, 216, 234, 240, 249, 256, 271,303, 310, 326, 337, 338, 341, 354, 364, 370,371, 388, 394, 404, 406, 410, 428, 453, 462,465, 466, 475, 480

II, 7, 261, 326III, 523abstract machine, 410benchmark program, 503call, 56clause, 14, 193compilation technology, 196compiler, 23, 191, 196, 222, 367computation rule, 95control, 198cut, 489debugging, 503


Prologdistributed processor, 384evaluation, 521execution, 354extension, 168extralogical features, 336fixpoint semantics, 27goal, 211implementation, 17, 78, 106, 256, 271, 338, 360,

366, 410, 455prolog implementation technology, 365Prolog interpreter, 40, 52, 196, 205, 208, 211, 476&-Prolog language, 453Prolog

language, 9, 49left to right execution, 498like, 36machine, 406meta-interpreter, 120, 234metaprogram, 509parser, 14performance, 271predicate, 360

Prolog program, 23, 25, 30, 43, 46, 49, 52, 71, 82,86, 96, 99, 186, 198, 203, 209, 211, 214, 240,251, 311, 330, 336, 345, 371, 403, 404, 409,462, 465, 480

transformation, 25Prolog

programming, 141proof procedure, 370semantics, 190specific operation, 406

Prolog styleinterpreter, 59proof, 115

Prologsystem, 12, 26, 41, 65, 163, 365, 366, 410, 448,

503technology, 354

Prolog term, 175, 468representation approach, 410

Prologtracer, 466, 503with cut, 78

proofby case analysis, 87calculi, 460method, 248, 440of correctness, 75, 345of termination, 198procedure, 79, 128, 129, 351, 355, 407, 416, 512system, 332

proof theoretic, 471issue, 264

semantics, 431, 471proof theory, 40, 93, 110, 182, 375, 440, 465, 514

for ILP, 275proof tree, 40, 144, 205PROP, 311, 348‘Prop’-ositional logic program, 330propagating instantiation information, 84propagation, 237, 346, 407, 446

mechanism, 346properness of refinement operators, 415property of programs, 265Propia, 237propositional, 179, 439, 489

calculus, 134, 138, 179case, 331, 439clauses, 411connective, 452formalism, 157formula, 103, 159, 348

propositional Hornformula, 15, 124, 143satisfiability, 124

propositional learning, 487propositional logic, 61, 179, 218, 348

programming, 134, 135, 167programs, 330

propositionalmodal Horn clause, 57program, 167

protectedcircumscription, 35data, 35

protection, 35protocol, 337protocol based

clinical trial, 337treatment of cancer, 337

PROTOS-L, 257prototype, 339, 368, 371, 401

compiler, 409implementation, 388, 425, 444

prototyping, 342provability, 83, 167provable, 93, 114, 176

goal, 114proving

correctness of directional types, 403inequations, 129

proving termination, 277, 409, 464of logic programs, 277properties, 198

pruning, 374, 443a search tree, 306derivations, 238device, 103


pruning effects of simplification, 203Przymusinski, 184, 331, 375, 412

SLS-resolution, 184Przymusinski, T, 439PS, 278

program, 278PSPACE, 379pure Prolog, 175, 240, 428, 456

program, 353, 428with built-in predicates, 428

pure rule based system, 489purely declarative logic programming language, 369pushdown automaton, 500PYTHON, 113

QQ (modal logic), 57, 179QPP, 351quadratic growth, 485qualitative

deduction, 40description, 486reasoning, 450simulation, 216

quantification, 323, 505quantified

default query, 163negative constraint, 261record description, 319term, 80, 358

quantifier, 51, 323, 374quantifier free

constraint, 169term, 80

quantitativededuction, 40method, 486

quasi-ordered set, 415quasilinear time, 261query, 21, 26, 38, 41, 65, 69, 72, 110, 118, 140, 151,

152, 164, 166, 202, 212, 238, 310, 312, 315,338, 343, 353, 407, 426, 429, 444, 461, 466,489, 492, 493, 494, 501, 508, 521

query answering, 514plan, 493

queryanswers, 381binding information, 238capabilities, 494

query evaluation, 41, 44, 70, 202, 310, 327, 423, 458algorithm, 150method, 212procedure, 5, 423process, 26

queryfor a disjunctive program, 514goal, 152, 160interface, 494language, 12, 220, 358, 466manipulation command, 444optimization, 387plan, 493processing, 351rewriting algorithm, 494

querying data and knowledge, 492

RR+M constraints, 404Raatz, 359Raffaetà, A, 492Rajasekar, A, 461random oracle, 377randomly generated problem, 103range restricted

HiLog program, 253normal program, 253

RAP, 241Raphael, Bertram, 77rapid prototyping, 321rational tree, 523

constraint, 523system, 261, 319

reachability analysis, 500reactive

constraint logic programming, 444extension, 444

realconstraint, 401numbers, 235physical organization, 340time control, 118

reals, 401reasoning, 31, 153, 168, 186, 247, 396, 399, 420,

504, 514, 521about action and change, 398about actions, 247, 397about change, 373about discrete event processes, 162about dynamic systems, 391about effects of concurrent actions, 399about equality, 200about programs, 18, 440, 523about the past, 250capabilities, 354in open domains, 265on constraints, 450problem, 247process, 414


reasoningsystem, 489task, 333, 445with defined predicates, 407with undefined abducible predicates, 407

recognition of plans and intentions, 318recognizing

a squeeze play, 113squeezes, 113strings, 14

recomputation, 336reconstructing, 231reconstruction, 272, 331, 468reconstruction of

λProlog, 468Prolog II, 7

reconsult, 173record object, 363records for logic programming, 261recurrent logic program, 464recursion, 58, 149, 458, 496recursion theoretic, 58

complexity, 408result, 244

recursion with recursively redundant predicates, 207recursive

class definition, 363coding, 282database query language, 149enumerability of relations, 185equational program, 63

recursive function, 214theory, 38

recursiveinvocation, 322logic program, 75, 322, 496maximal rule, 140negation, 94plan, 493

recursive predicate, 151, 152logic program, 282

recursive procedure, 30recursive program, 221, 322

scheme, 63recursive query, 150, 151, 493

answering plan, 493evaluation, 70plan, 493

recursiverule, 152, 207theory, 429type, 303

recursivelybounded, 64defined, 70

denned predicate, 70recursively enumerable, 72

set of ground atoms, 145recursively

typed complex object, 424unsolvable, 220

redex, 92reduce-or

process model, 154trees, 154

reduced instructionset, 158set computer, 97

reductionof constraint answers, 458of Parlog to Kernel Parlog, 22semantics, 175

redundancy, 55, 199, 488redundant, 199

action, 160answer elimination, 458argument, 498bound check, 186computation, 241

referencedata type, 505theory, 87

referencing mechanism, 505refinement, 452

graph, 487operator, 415

reflection between levels, 254reflexivity, 71refutation, 71, 121, 187, 413

method, 90procedure, 121proof, 79search, 138

register, 206, 470regression, 486regular extension semantics, 514regular model, 313

semantics, 305regular type, 145regularized structure, 55regularly recursive predicate, 151Reiter, 5, 35, 122, 373, 389

closed world assumption, 5, 122default logic, 373

relation learning task, 487relational algebra, 35, 83, 405

expression, 69formulas, 83operation, 431


relationalanalysis, 500approach, 500calculus, 405clause, 475database, 21, 152, 171, 220form of interval arithmetic, 235language, 9model, 431paradigm, 460program clause, 475query, 220

Relationlog, 431relationship, 257relativization, 459relativized closed world assumption, 122relaxation, 103

scheme, 103relaxed subproblem, 103relevance, 382, 487

of literal, 487remote blackboard, 459renaming, 498reordering, 479

CLP(RLin ) programs, 479repeated goal, 205repetitive computation, 393representability of families of sets, 451representation, 130, 176, 358, 380, 414, 459

of actual occurrences of actions, 400of completed proofs, 130

representation of hypotheticaloccurrence of actions, 400situations, 400

representationof inclusive disjunctions, 416of information, 430

representational power, 265representative, 47representing action, 392, 400

and change, 250representing

and-or parallel execution, 336derivable information, 421

representing knowledge, 130, 416about actions, 392

representing theories, 414required constraint, 236reset depth, 158residual program, 231, 252, 461residuating logic programs, 314residuation, 314

principle, 314set, 314

resolution, 36, 51, 211, 212, 249, 359, 448, 485as a specialisation operator, 485based inference, 49calculus, 176procedure, 9

resource allocation, 442restart rule, 36restricted

and-parallelism, 241goal level independent and-parallelism, 453

restriction, 192, 486grammar, 55mapping, 385on problem variables, 237

retract, 107, 173retractable constraint, 216retracting program clauses, 323retrieval of lemmas, 377retrieving data, 405retrospective zooming, 88return value placement, 470reusability, 454reusable, 454

modules, 454reuse, 446revised rule base, 489revision

program, 372, 373programming, 373

rewrite, 55, 360, 407constraint, 441program, 203

rewrite rule, 10, 54, 56, 203, 505laboratory, 409system, 179

rewriterules for equality, 407system, 409

rewriting, 92, 175, 208a program, 150logic, 460strategy, 208technique, 170

rewritten program, 238Reyle, 168RISC, 97

code, 97RISC-CLP(R), 440RITE, 92ROBDD, 482robust, 360

semantics for logic programs, 310robustness, 335, 361Ross, 184, 253, 412, 461


Ross and Topor WGCWA, 461Rounds, 233RRL, 409rule based

deductive database, 308expert systems with uncertainty, 182formalism, 392language, 283program, 489query language, 283reasoning, 40system, 69, 157

ruleorder, 489set, 40with equational constraints, 439with variables and function symbols, 439

rulebase, 379, 489with k strata, 379

rules+ strategies approach, 268as actions, 389

run-time, 107, 144, 257, 422run-time behavior, 506

of programs, 189run-time

environment, 32error, 467goal independence, 194performance, 393, 417property, 144structure, 475

run-time system, 361implementation, 285

run-time type checking, 145, 199

SS-model semantics of a program, 228S-semantics, 228, 374, 509

approach, 266S4 (modal logic), 57, 279, 316S5 (modal logic), 57, 179safe

implementation method, 152omission of the occur check, 465rule, 140

safeness of polymorphic type analysis, 425safety, 150, 337Sager, 55

string grammar, 55Sagiv, 220sample computation, 136SASL, 71SAT, 103

satisfaction, 438of integrity constraints, 516

satisfiability, 57, 83, 124, 143, 169, 218, 220, 261,319, 347

checking, 169in EM, 83of a set of clauses, 215of conjunctions of positive and negative con-

straints, 261of LL(1) requirements, 14of modal Horn clauses, 57

satisfiability of propositionalformulae, 103Horn formulae, 15, 124

satisfiabilityof systems of linear equalities inequalities and

disequalities, 234problem, 15, 103

satisfiable, 218, 411satisfying interpretation, 143Sato, 190, 226, 313Sato Tamaki depth-k abstraction, 190SB-Prolog, 195SC-based system, 410scalable multiprocessor architecture, 123sceptical logic programming, 502scheduling, 394, 442, 450

algorithm, 106method, 357of processes, 356of processors, 106policy, 356, 384problem, 342

schema, 254, 496browsing, 405evolution, 405integration, 405

SchemaLog, 405syntax, 405

Scheme, 66, 71continuation, 66environment, 66

Schlipf, 184, 461WFSC, 461

scientific discovery, 275scons, 447

constructor, 447scope, 401

of logic programming, 153rule selection, 516

scopingconstruct, 323mechanism, 272of left noun modifiers, 55


Scott domain, 175SDG, 332SE method, 138search, 40, 60, 71, 114, 119, 230, 358, 415, 446, 487

control operator, 389forest, 412

search problem, 444with constraints, 116

searchspace, 17, 104, 123, 217, 249, 357, 412, 414, 451specification, 505strategy, 412tree, 103, 414

second level, 338second order

formula, 245logic, 379property, 253syntax, 253

Sedogbo, 55Seki, 212, 226selection, 69

rule, 267, 409, 464, 509selectional restriction, 55selfadjusting control mechanism, 377selfconsistency, 199selfreference, 363selfreflecting language, 19semantic

accuracy, 417approach, 198

semantic based program analysis, 455algorithm, 189

semanticbasis, 476characterization, 507construct, 438

semantic definition, 324of GMEC, 452

semanticdifference, 50equivalence, 196foundations of CLP, 438framework, 177, 305, 463, 520kernel, 313model, 209, 256network, 115object, 324precision, 417

semantic representation, 54, 358language, 358of sentences, 56

semantic unification, 306semantical, 461, 478

semantically equivalent, 28, 101program, 47

semantics, 40, 58, 67, 72, 73, 76, 78, 94, 101, 110,117, 133, 148, 175, 182, 190, 192, 203, 217,219, 221, 223, 226, 228, 236, 247, 248, 249,253, 266, 268, 270, 278, 302, 304, 305, 308,310, 313, 315, 331, 333, 335, 353, 355, 356,358, 359, 381, 382, 389, 394, 397, 412, 417,420, 421, 422, 439, 447, 458, 460, 461, 463,469, 471, 473, 476, 478, 480, 504, 509, 511,512, 513, 514, 520, 521

approximation, 189based dataflow analysis, 190

semantic based programanalysis, 266transformation, 266

semanticsdecidability, 509for a metaprogram, 302for disjunctive programs, 304

semantics for logicprogramming, 478programs, 420, 421, 471

semantics for logic programs with negation, 245,389

as failure, 331semantics for natural language, 38semantics for negation, 308

as failure, 72, 304semantics

for positive programs, 101for programs, 460for programs with finite sets, 447for the cut, 209for untyped vanilla metaprograms, 302of a program, 248, 253of action, 250of Apt, Blair, and Walker, 375of Clark, Fitting, and Kunen, 245of constraint logic programs, 438of disjunctive logic programs, 461of first order hereditary Harrop formulae, 239of functional programming, 13of general logic programs, 421of Horn clause rules, 40of logic programming, 156, 355

semantics of logic programs, 266, 304, 305with equality, 359

semanticsof logic variables, 66of narrowing grammar, 208of natural language sentences, 56of negation, 333of nested sets, 431


semantics of normaland disjunctive logic programs, 304logic programs, 210programs, 313

semantics of Prolog, 198programs, 78

semantics of the update language, 307semi-automatic verification, 162semicompleteness, 104semicomputability, 185semidecision, 129

procedure, 129seminaive approach, 70sentential, 126

logic, 126separable recursion, 207sequencing, 442sequent, 332

80386 based multiprocessor, 361calculus proof system, 332

sequentialabstract machine, 105algorithm, 48, 100execution, 301logic language, 271nature, 4optimization, 384processing, 106, 138program, 384

sequential Prolog, 104implementation, 271programs, 46semantics, 336

sequentialsegment of a logic program, 146simulation, 61solution for unification, 4

serializable transaction, 142series approximation, 85set, 475

abstraction, 50set based

atom, 477syntactic object, 477term, 477

setconstructor, 148, 447data type, 505enumeration, 431grouping, 431inclusion, 248, 413logic program, 477matching, 180, 475membership, 350

of clauses, 141, 218, 279, 316, 415, 497of constraints, 60of explanations, 511of formulas, 373of ground atoms, 83of operations, 475of possible worlds, 197of productions, 278of rules, 94, 308of terms, 240operation, 180oriented logic programming paradigm, 475pattern, 180reasoning over finite domains, 505substitution, 477

set term, 350matching, 170

settheory, 42, 447unification, 447, 475

set valuedfunction, 177, 180term, 180

SetAx, 447SGI MIPS-based host, 361shallow

backtracking, 222cut, 222

Shapiro, 67method, 67

sharability, 183shared configuration, 446shared memory multiprocessor, 106, 146, 241

implementation, 361Sharing (domain), 457sharing, 462sharing analysis, 345, 477, 523

of logic programs, 477sharing

information, 194, 523is optimal, 457of free variables, 191

Shepherdson, 31, 140, 227, 498Shiloach, 48Shiloach and Vishkin, 48SICStus, 523

object, 339Prolog, 340

side effect, 173, 336in Prolog, 173

sideways information, 150sideways information passing, 150

strategy, 160sieve of Eratosthenes, 27


�02, 126

�11-complete problem, 282

�Pk

, 379signal flow, 61signature, 319signed data dependency, 110SIMD

computer, 418implementation, 368, 418

simplechain program, 165linear program, 165model, 301

simplex method, 234simplification

method, 74operation, 521theorem for implementing integrity constraints,

26simplified problem reduction format, 168simply typed

λ-calculus, 358λ-term, 358, 468

simulating, 162simulation, 341, 357

of negation as failure, 416results, 506system, 123

simultaneous, 119bound, 3

single levelproblem solver, 8programs, 8representation language, 254

single processor system, 106single rule

chain program, 481Datalog program, 481program, 165

single solutionrelation definition, 22subset, 22

SIPS, 160site, 385situation, 390situation calculus, 171, 327, 372, 388, 389, 390, 392,

396, 399, 517semantics for logic programs, 389

skepticalEC, 452reasoning, 520semantics, 521

Skolem constant, 83Skolemization, 51

of abductive atoms, 413

Skordev, 205SL resolution, 36SLD derivation, 24, 144, 497

tree, 374SLD refutation, 196, 509SLD resolution, 17, 87, 90, 104, 125, 175, 187, 227,

301, 322, 334, 350, 351inference, 322of equational formulas, 50

SLD tree, 24, 104, 154SLD-AL resolution, 212SLD-II resolution search space, 71SLDE! resolution, 359SLDN refutation, 121SLDNF, 110, 167

derivations, 110, 277resolution, 12, 108, 128, 140, 159, 190, 224, 259,

310, 331, 334, 343, 413tree, 227

SLDNFA, 413procedure, 407

SLDR resolution, 322inference, 322

SLG resolution, 412, 458, 521SLG-WAM, 521SLGCN, 458SLI derivation, 128slicing, 270SLINF derivation, 128SLNDF resolution, 37slow convergence, 443SLR

inference, 370parsing, 370

SLS resolution, 184, 249, 412smallest

Horn clause program, 347stable model, 246

smart cache, 158Smolka, 233Smolka and Rounds, 233SMS, 333SMSOL, 333

computation method, 333software

development, 473engineering, 496

solutioncompactness, 438sharing, 241

solvability, 133solver level, 505solving equations, 129

from Prolog, 43


solvinginequations, 129systems of recurrence equations, 322

sort, 257definition, 363predicate, 169

sorted structure, 363sorting, 363sound and complete, 93, 121, 161, 164, 184, 312,

331, 335, 351, 392, 407, 412, 471, 501, 511extension, 514implementation, 445proof procedure, 219, 405

soundand strongly complete lazy narrowing calculus,

460answer, 35implementation, 12relational algebra, 83

soundness, 12, 26, 175, 177, 209, 249, 400, 429soundness and completeness, 11, 17, 45, 223, 229,

248, 322, 391, 429, 452, 484results, 217, 407, 517theorems, 79

soundness of a loop check, 227soundness of Prolog, 72

evaluation, 167soundness of

SLDNF resolution, 37SLDNFA, 413the query evaluation process, 26

sourcecapability description, 494instrumentation, 503of information, 492program, 192, 231specific query, 494

spaceand time overhead, 82bound, 143of truth values, 156

specialclasses, 207purpose program, 116

specialised integrity checking, 427specialization, 192, 403, 498, 499, 519specialization of

logic programs, 499standard definitions, 61

specializationoperator, 485system, 499

specializedarchitecture, 406hardware, 406

specification, 102, 117, 118, 228, 248, 269, 391,395, 428, 446, 454

frame, 469language, 2, 117, 132, 145, 177, 446of a query, 426of circuits, 61of deductive databases, 427of ILP, 275

specifyingdynamic systems, 391sets in logic programs, 447

speech act, 318speedup, 100, 165, 346, 384split stack buffer, 158splitting, 407SPORA, 132spreadsheet-style interface, 337squeeze play, 113stability, 215stable, 382

chain, 378stable class, 305

semantics, 305stable generated

model, 478semantics for extended logic programs, 478

stable inference, 449stable model, 245, 246, 282, 333, 335, 355, 378, 382,

449, 451, 511, 516, 521computation, 451construction, 516

stable model semantics, 253, 305, 331, 333, 335,378, 387, 393, 408, 422, 449

for logic programs, 449of Datalog programs, 333

stablesemantics, 280, 304, 317, 383, 408, 461theory semantics, 313

stack, 106, 205, 206, 241buffer, 158reference depth, 158

standard ML, 175module system, 172

standardof correctness, 71semantics, 190, 324

Stärk, 429ESLDNF, 429

state, 318changing program, 142constraint, 327, 392, 396generation, 383space model of control, 66transformation, 84


state transition, 142static

analysis, 270, 457, 479, 499analyzer, 46causal law, 392integrity constraint, 327program, 107semantics, 461type checking, 199visibility rule, 279, 316world, 373

staticallyconfigured system, 229conservative approximation, 189

stationary semantics, 304, 355, 461statistical analysis, 486statistically, 337, 357statistics, 158status box, 88steadfast

logic program, 454program, 454

steadfastness, 454Stockmeyer, 98storage model, 106storing data and knowledge, 492stratifiability, 110stratification, 251stratified, 164, 166, 278, 281, 375, 381, 429

allowed database, 164closed world asumption, 213database, 74, 164Datalog, 422deductive database, 74

stratified disjunctivedatabase, 315logic program, 315, 382, 383

stratifiedembedded implication, 251HiLog program, 253logic program, 213

stratified normalobject program, 302program, 108

stratifiedproduction system program, 278program, 166, 213, 217, 226, 253, 315, 381, 382,

521PS program, 278semantics, 424

stratum of a program, 383stream

and-parallelism, 418parallelism, 474

stream-parallel logic languages, 474

strength of preference, 236strict

and allowed databases, 110independence, 301requirement, 236subset, 202

strictness, 108string

representation, 98variable grammar, 320

strong termination, 214strongest semantics, 228strongly complete, 133structural

aspect, 338constraint, 363data abstraction, 172imbalance, 357induction, 468information, 519

structurebased unfolding, 352copying, 410information, 519

structure sharing, 410representation, 80

structureskeleton, 410untupling, 519

structured character description, 338structured logic


structured program, 213structuring

construct, 279, 316logic programs, 279, 316of Web information, 430

Stuckey, 101, 479subclass, 234, 382subconditional theory, 126subdomain of Pos, 522subexpression, 85subgoal, 59, 138, 163, 205, 310, 323, 374, 448, 458subgoal-extraction method, 138sublanguage, 169sublogic, 156Subrahmanian, 304, 305, 504Subrahmanian, V S, 492, 504subset, 475

assertion, 180clause, 475

subset equationallanguage, 180program, 180


subset logicparadigm, 475program, 475programming, 475

subset primitive, 22subsort, 178, 257

facility, 10ordering, 363

substitution, 90, 194, 311, 368, 448, 499factoring, 448

substitutivity, 71substructural

calculus, 471substructural logic, 332

sequent calculus proof system, 332subsumption, 91, 415

based loop checking, 203checking, 386model, 422of equality axioms, 91stratified Datalog, 422

subsystem, 178subtask, 129, 133subterm, 16, 92, 311subtree, 261subtype, 178, 257success, 394

branch, 414continuation, 66pattern, 258, 330set, 37, 94, 101, 190, 239

super Monaco, 361optimizing compiler, 361

supercompilation, 498superimposed coding, 141support for negation, 128supported set, 416surderivation, 68

strategy, 68surface structure, 55suspending

execution of goals, 362goals, 371

suspension effect, 362suspension free, 356

logic program, 362SVG, 320switching

instruction, 109system, 118

symbol table, 365symbolic

computation, 80, 233constraint, 346norm constraint, 476

symmetry, 71synchronization, 183synchronizing, 384syntactic

characteristics of programs, 84characterization, 3class of programs, 343object, 477parallelization, 183property, 426restriction, 226structure, 404structures, 112sugar, 279, 316

syntacticallyhigher order, 405restricted, 312

syntaxand semantics for CHR, 441of definite clauses, 42of hybrid probabilistic programs, 501of programs, 416

synthesis, 2, 135, 358, 385, 496, 497by informal methods, 269method, 497of formulations of mathematical theorems, 137of logic programs, 495, 497of recursive logic programs, 496

synthesis process, 269system of equations, 345

and inequations, 129Szpakowicz, Stanislaw, 62

TT (modal logic), 57, 179tableau proof procedure, 79tabled

evaluation, 521logic program, 448

tablingengine, 521in logic programming, 448

tabulated resolution, 412tabulation, 386, 412tag manipulation, 186tagging, 380tail call, 470

optimization, 470tail recursion, 75, 120

optimization, 59Tamaki, 190, 226, 313Tamaki and Sato, 226, 313target

assembly code, 361language, 2, 112, 365


Tärnlund, 2Tarski, 38

argument, 38semantics, 169

Tarskian semantics of Horn clause rules, 40task

distribution rule, 357migration, 357scheduling, 357switching, 106

taxonomy, 49of logic theories, 206

TCP/IP link, 459technological

knowledge, 135model, 135

telecommunication switching system, 118telephone line controller, 118template, 212Templog, 197temporal, 216

behavior, 19extension of Prolog, 216formalism, 452logic, 36, 216, 478projection, 250Prolog, 216

temporal reasoning, 182, 450, 452formalism, 390

temporal updating, 36term dependence information, 194term matching, 4, 98

problem, 98term representation method, 410term rewriting, 98, 177, 178, 200, 409

approach, 200method, 200system, 177, 179, 409

terminal symbol, 332terminating, 312, 363, 456

logic program, 464simplification system, 319system, 498

termination, 68, 102, 211, 249, 258, 267, 334, 347,409, 428, 456, 458, 462, 464, 465, 476, 498

termination analysis, 267, 476of logic programs, 476

terminationbehavior, 214due to floundering, 334

termination ofgeneral logic programs, 334logic programs, 277, 464Prolog programs, 198

termination of wellmodedlogic programs, 409programs, 456

terminationordering, 409problem of logic programs, 409proof, 189, 267property, 456, 476

testcase generation, 270generation, 341

testing, 509for membership, 240methodology, 117problem, 509

textual order, 78theorem prover, 11, 36, 44, 130, 163, 428theorem proving, 77, 327, 517

technique, 517theorem synthesis, 137theoretical

foundations, 428logic, 80

theory, 126, 243, 254, 275, 276, 414about proofs in other theories, 130about theories, 130for finite sets, 447formation, 260in sentential logic, 126of actions, 372

theory revision, 373, 489algorithm, 489

theory update, 373θ -subsumption, 415third truth value, 38thread

construction, 474of control, 368

three-valuedcompletion semantics, 343, 407

three-valued logic, 38, 101, 110, 221, 343interpretation, 38

three-valuedmodal logic, 429program model, 38semantics, 110stable model semantics, 331wellfounded semantics, 248

tightcompletion, 221consistent computable semantics, 221derivation, 94, 114semantics, 221tree semantics, 94


tightness, 114time

and space complexity, 143efficiency, 240evolving problem, 444point, 390, 507

timetabling problem, 342timing constraint, 118TMS, 516TOAM, 222top level query, 212top-down

computation of queries, 310definition of SLDNF resolution, 259

top-down evaluation, 310, 386, 448method, 212

top-downexpectation, 516exploration, 160framework, 402, 448induction of logic programs, 485inference, 138method with memoization, 212parsing, 139partial deduction, 387query evaluation procedure, 429semantics, 24, 324

topological branch and bound, 237Topor, 461tortoise and hare technique, 59total

ambiguity, 481correctness, 465order, 283recursive function, 214specification, 248stable model semantics, 333

toxicity, 337of treatment side effects, 337

TPM, 88trace, 503

analyzer, 466information, 503of program executions, 466output, 205

trace querylanguage, 466mechanism, 466

trace sharing, 523tracing, 503

facility, 88for sequential Prolog, 270Prolog programs, 503

tractability, 244

tractabledisjunctive Datalog, 508fragment of disjunctive Datalog, 508subset, 508

traditional logic programming context, 66traffic ratio statistics, 158trail

mechanism, 66testing, 186

trailing, 86, 97training labeled queries, 489transaction, 492

log, 327pattern, 427

transferability, 513transformation, 186, 229, 328, 399

algorithm, 63analysis, 474for CSLD derivations, 444

transformation oflogic programs, 18, 268, 495, 497programs, 75, 151Prolog programs, 78

transformationoperation, 228procedure, 409rule, 268scheme, 186technique, 95, 121, 252to homogeneous form, 91

transformationalapproach, 121, 268methodology, 409

transformeddatabase, 164program, 151, 212, 226, 488query, 212

transforming programs, 488transition

function, 192, 250relation, 118system, 189

transitive closure, 475, 481transitivity, 71

axiom, 91translated program, 516translating, 71, 85, 478

numerical algorithms, 85user queries, 494

translation, 43, 85, 112, 167, 365, 374, 392, 399,416, 516

of theories, 399problem, 493

transparent distribution of data, 459


transparentprogram, 32Prolog machine, 88

transputer, 384tree, 25, 88, 94, 98, 154, 205, 230, 241, 261, 336

adjoining grammar, 321constraint, 234development, 154manipulation algorithm, 25oriented abstract machine, 222representation, 154rewriting, 7unification, 523

trial management, 337trie, 448trigonometric function, 486true negation, 333Truszczynski, 304, 372, 373truth

function, 61ordering, 246predicate, 38valuation, 307

truth value, 38, 40, 458gap, 38of fluents, 400space, 156undefined, 331

tuple data type, 505Turing

complete, 353degree, 282machine, 64, 329, 347, 424

two-counter machine, 329two-person game, 40two-valued

logic, 110, 156, 343minimal models, 382model, 382semantics, 110

type, 462type analysis

of Prolog, 303system for Prolog, 303

typecheck, 199checking, 144, 145, 199computation, 257declaration, 199dependency, 199

type error, 199free, 199

type graph, 303domain, 303

type handling, 257

type inference, 145, 189, 190, 199system, 303

typeinformation, 191, 194, 303, 425synthesis, 144

type system, 145, 178for logic programs, 145

type theoretic, 233typed

complex object, 424extension of Datalog, 431first order formula, 26, 41λ-calculus, 51, 358language, 380logic programs, 199

types for logic programming, 10, 20

UU-graph, 277U-tree, 230ULL, 307Ullman, 220ultrametric space, 472unambiguous context free grammar, 358unary function, 255

symbol, 312unary

logic program, 145partial function, 169predicate, 255, 319

unbound variable, 86uncertain

knowledge, 391specification, 391

uncertainty, 182, 351, 473, 501undecidability, 329

of Datalog boundedness, 329undecidable, 145, 149, 169, 220, 306, 329, 347, 363,

429boundedness problems, 329

unfold/fold, 497, 498unfold/fold proof, 497

method, 497unfold/fold transformation, 226, 313, 498

rule, 497unfolding, 228, 230, 352, 382, 387, 407, 476, 485

program transformation operator, 389property, 461

unifiable subset of a set of constraints, 60unification, 4, 10, 28, 50, 54, 60, 64, 84, 90, 100,

141, 160, 191, 233, 237, 256, 267, 303, 306,322, 323, 363, 368, 403, 410, 457, 477

algorithm, 2, 11, 68, 80, 102, 125, 256, 345, 350,407

complexity, 64


unificationfailure, 82grammar, 169in Prolog, 141in SLDR resolution, 322instruction, 109, 231modulo a set of equations, 90of a set of equations, 477of quantified terms, 80of terms, 4process, 11, 49, 314step, 64with occur check, 256without occur check, 256

unifiedframework, 186, 211, 212, 269logic programming, 318processing, 401theory, 197

unifier, 90, 92uniform

approach, 260, 313boundedness, 329framework, 269treatment, 346

unify, 152unifying

framework, 270, 279, 304, 316, 465pairs of terms, 306types, 199

uninitializedargument, 360variable, 360

union, 180, 469uniprocessor, 105, 368unique supported model, 281unit

clause, 97, 411resolution, 103

universalfirst order theory, 176Horn formula, 64interlingua, 459netlist translator, 112quantification, 239, 323, 505quantifier, 350safety, 312task distribution rule, 357termination, 267, 277

universality, 197universally quantified

clause, 93second order logic, 21

universe of terms, 180unpredictable iterations in number theory, 347

unrestricted logic program, 221unsatisfiability, 306

for equational logic programming, 306unsatisfiability of

a system of equations, 306equation sets, 306propositional Horn formulae, 65

unsolvability, 140, 440unsolvable problem, 140unsorted, 257unsoundness, 209untagged object, 380untrailing, 86untupling, 519untyped

logic programming, 257nonground metaprogramming, 302

update, 307, 327, 373, 427, 492, 507update language, 307

interpreter, 307update

of interpretations, 373of knowledge bases, 507operator, 307pattern, 427procedure, 307, 427program, 507propagation, 492rule, 373transaction, 327

updateabledefinite logic program, 252knowledge base, 252program, 252

updated database, 278, 327upper

and lower bounds, 283bound, 152

useless occur check elimination, 189user

constraint, 346definable abstract data type, 178

user definedabstraction, 88constraint, 441

userexpectations, 231interface, 88language, 142query, 493

Vvalidation, 44

method, 248validity, 102, 319, 471


valuation, 246, 307value

based language, 283cell, 106of a game, 40

VAM, 366VAM 1P, 366VAM 2P, 366VAM AI , 366van Emden, 76, 155van Emden and Yukawa, 155van Emden Kowalski semantics, 76van Emden Yukawa completeness result, 155van Gelder, 184, 204

algorithm, 204loop detection algorithm, 204

van Gelder, Ross, and Schlipf, 184vanilla metaprogram, 302variable

aliasing, 84, 194bounded EFS, 187dependency, 194free atom, 214

variable sharing, 477information, 194

verb phrase, 56verification, 14, 61, 269, 463, 465

method, 463verification of

logic programs, 428, 465total correctness, 465

verification technique, 162verified Prolog compiler, 196verifying, 162, 389, 467

integrity constraints, 427programs, 440

versions vector, 106model, 106

very high level language, 132viability of data or-parallelism, 368Vienna

abstract machine, 366definition language, 73

view, 494virtual

presence, 459shared memory, 506translator, 112world, 459

Vishkin, 48visibility rule, 279, 316visualization, 270VLSI-BAM, 406VLSI/CAD system, 112VRML, 459

VSM, 506scheme, 506

WWadge, 197waking up of goals, 371Walker, 108, 375WAM, 97, 123, 146, 196, 206, 222, 241, 257, 323,

371, 414, 475, 521and-or structure, 257architecture, 158, 346

WAM basedengine, 442Prolog, 158system, 414

WAMcode, 97, 448execution, 196instruction, 180optimization, 257type compiler, 109

Warren, 82, 86, 97, 158, 196, 206, 231, 241, 253,257, 271, 323, 371, 412, 414, 475, 521

Warren abstractmachine, 82, 146, 158, 196, 206, 231, 241, 257,

271, 323, 371, 414, 475, 521Prolog instruction set, 86

WarrenDEC-10 compiler, 271last call optimization, 196

Warren machine, 97instruction, 97

Warren, D H D, 206Warshall, 481weak completeness, 248weakest semantics, 461weakly confluent, 439weakly perfect, 302

Herbrand model, 302weakly

reducing EFS, 187stratified, 302

weakly terminating, 439calculus, 439

Webapplication, 430browser, 430page, 430programming, 430search, 430

wellbehaved program, 359wellfounded, 308wellfounded choice, 335

model, 335semantics, 335


wellfoundeddisjunctive hypothesis semantics, 520measure, 352

wellfounded model, 246, 310, 355, 381, 520, 521semantics, 393

wellfoundednegation, 184ordered search, 381ordering, 267, 352, 497semantics, 184, 226, 245, 247, 248, 249, 253,

280, 304, 310, 317, 318, 335, 381, 408, 412,422, 458, 461, 473, 521

wellmoded, 474logic program, 409program, 456query, 409

wellquasi-order, 498welltyped

program, 145subset, 353

welltypedness, 403welltyping, 145

condition, 403WFDH, 520WFS, 247, 382, 461WFSX, 247, 318

widening, 482operator, 303

Winslett, 373Woods, 55working memory, 16world, 511

knowledge, 318, 459worst case, 451

complexity, 57, 157complexity analysis, 152groundness analysis, 482

XXOLDTNF resolution, 249XSB, 475, 521

system, 521XSM semantics, 331

YYou, 305You and Yuan, 305Yuan, 305Yukawa, 155

ZZadeh, 40Zermelo-Fraenkel set theory, 447

Subject Index to Volumes 1–46 - COnnecting REpositories · 2016. 12. 9. · Subject Index to...

Documents

Transcript of Subject Index to Volumes 1–46 - COnnecting REpositories · 2016. 12. 9. · Subject Index to...