|
 |
Авторизация |
|
 |
Поиск по указателям |
|
 |
|
 |
|
 |
 |
|
 |
|
Ramsay A. — Formal Methods in Artificial Intelligence |
|
 |
Предметный указатель |
(belief structures) 162
28
24
, introduction rules 24
7
, inference rules 13
, semantics 9
, syntax 7
, vocabulary 7
121
8
121
39
36
-calculus 234
37
11
8
81
11
& 12
Accessibility (between worlds) 120 122
Action and knowledge 155
Antecedent 8
Arguments of a function 50
Assumption-based minimal labels 227
Assumption-based nodes 226
Assumption-based truth maintenance 224
ATMS see "Assumption-based truth maintenance"
Axioms 13
Backward chaining 74
Barcan formulae 130
Basic beliefs 162
Basic index for EML 152
Basic rule of game theoretic semantics 258
Basic unification algorithm 66
Belief map 162
Belief structures 162
Beth system 6
Binding (in unification) 65
Binding a variable 36
Canonical model 48
Causality 9
Characteristic function 235
CIRC see "Circumscription"
Circumscription 204
Circumscription, minimal models 210
Clausal form 78
Closed tableau 30
Closed world assumption 178
Closed world assumption, as default rule 194
Compactness, of FOPC 47
Complete labels in the ATMS 227
Complete set of sentences 45
Complete theorem prover 62
Completeness 4
Completeness of 28
Completeness of 21
Completeness of FOPC 49
Completeness of resolution 83
Completeness of set of support 88
Complex index for EML 152
Compositional semantics 245
Conditional proof justifications 223
Confluence 115
Conjunction 12
Connection graphs 96
Connection matrices 105
Connection method (for FOPC) 105
Connection method (for FOPC), algorithm 109
Connection method (for FOPC), method for modal logic 140
Connections (in a matrix) 106
Consequent 8
Consequential closure 160
Consistency 21
Consistency of 21
Consistency of FOPC 45
Consistent labels in the ATMS 226
Consistent set of sentences 45
Constants 35
Constraint propagation (in connection graphs) 101
Construction of entities 271
Constructive extension 261
Constructive logic 254
Content (of an index) 132
Contexts (in the ATMS) 226
Contingent truths 118
Contradictions (in the TMS) 222
CWA see "Closed world assumption"
Database reduction 116
Decidability of 23
Deduction structures 160
Deduction Theorem for 17
Deduction Theorem for FOPC 40
Deductive machinery 162
Default logic 194
Default proof 201
Default rules 200
Default rules, normal default rules 201
Denseness (of time) 170
Destination (of an index) 132
Destruction of entities 271
Disjunction 11
Domain of a function 236
EML see "Epistemic modal logic"
Environments (in the ATMS) 226
Epistemic modal logic 152
Epistemic modal logic, reification 154
Event calculus 180
Existential quantifier 39
Expert Systems 265
Expression schema 8
Extension Lemma for FOPC 45
Extensional definition of relations 37
Extensions (of a default theory) 195
Fact garbage collection 213
Factors of a clause 79
First-order modal logic 129
First-order modal logic, reification 143
First-order predicate calculus see "Predicate calculus"
FOPC see "Predicate calculus"
Formula 7
Frame 121
Frame axioms 177
Frame problem 180
Frame, modal 121
Frame, non-monotonic 211
Frame, situation 176
Frame, temporal 172
Free variables 36
Function, arguments of 50
Functional relations 50
Functions 50
functor 50
FUTURE (temporal operator) 165
Fuzzy complement 267
Fuzzy logic 265
Fuzzy set theory 266
Game theoretic semantics 257
Game theoretic semantics, basic rule 258
Game theoretic semantics, logical rules 258
Game theoretic semantics, structural rule 259
Generalisation 36
Gentzen systems 25
Ground instance 83
HALTS 54
Herbrand universe 48
Heuristic search 95
Hilbert system 7
Implication 8
| Implication, material 10
Implication, relevant 264
Improved unification algorithm 68
Inclusive-or 11
Incompleteness of arithmetic 52
Index for EML 152
Indexed formulae 132
INIT (in event calculus) 181
Initiation rule (in event calculus) 181
Intervals 184
Intervals in event calculus 182
Introduction rules for 25
Intuitionists 254
Isolated literals 116
Justification-based nodes 216
Justification-based truth maintenance 214
Justifications (in the TMS) 216
Knowledge and action 155
Liar paradox 242
Lifting (for predicate calculus proofs) 84
Linear input resolution 90
Linguistic truth values 268
Literals 79
Logic programming 76
Logical rules of game theoretic semantics 258
Material implication 10
Matrix construction algorithm 108
Merging equations (in unification) 70
Meta-language (in reification) 144
Minimal labels in the ATMS 227
Minimal models (for circumscription) 210
Minimal temporal logic 173
Modal frame 121
Modal logic 118 122
Modal logic, first-order 129
Modal logic, normal modal logic 123
Modal logic, soundness 126
Modal tableau 133
Model 2
Model for FOPC 37
Model theory 4
modus ponens 13
Monotonicity 189
Montague Grammar 244
Naming apart 79
Natural deduction systems 25
Necessary truths 118
Negation as failure 75
Negation normal form 114
Nodes (in the ATMS) 226
Nodes (in the TMS) 216
Non-monotonic frame 211
Non-monotonicity 190
Normal default rules 195
Normal Form Theorem 79
Normal modal logics 123
Normal temporal logic 208
Object language (in reification) 144
Occurs-check (in unification) 69
Order strategies in resolution 87
PAST (temporal operator) 165
Path (through a matrix) 106
Persistence axiom 183
Points (in time) 184
Possible worlds semantics 121
Predicate calculus 35
Predicate calculus, axioms and inference rules 39
Predicate calculus, compactness 47
Predicate calculus, completeness 49
Predicate calculus, Extension Lemma 45
Predicate calculus, models 37
Predicate calculus, semantics 37
Predicate calculus, soundness 43
Predicate calculus, syntax 35
Predicate calculus, undecidability 52
Predicate calculus, vocabulary 35
Preferential satisfaction 211
Primary predicates (in situation calculus) 180
Prime of a formula (in prepositional calculus) 21
PROLOG 76
proof 14
Proof in 14
Proof in FOPC 40
Proof theory 4
Property theory 234
Propositional calculus 6
Propositional calculus, adequacy 12
Propositional calculus, completeness 21
Propositional calculus, decidability 23
Propositional calculus, soundness 20
Propositional modal logic 121
Propositional modal logic of time 171
Propositional modal logic, reification 143
Pure literals 100
Quantified belief language 162
Quantifying-in 158
Range of a function 236
Reification 143
Reification of epistemic modal logic 154
Reification of first-order modal logic 147
Reification of propositional modal logic 143
Reification of temporal logic 171
Relations over a world 37
Relations, extensional definition 37
Relevant implication 264
Resolution 78
Resolution, completeness 83
Resolution, connection graphs 97
Resolution, linear input 90
Resolution, order strategies 87
Resolution, restriction strategies 87
Resolution, set of support 87
Resolution, theorem prover 81
Resolution, unit preference 95
Resolvent 78
Restriction strategies in resolution 87
Rigid designators 130 158
Round (in a game) 259
Safe theorem prover 63
Satisfaction (of a formula by a model) 37
Search space reductions 116
Search strategies (for resolution) 86
Secondary predicates (in situation calculus) 180
Semantic tableau 28
Semantic tree 84
Semantics of generalised statements 38
Sentences 36
Sequent arrow 25
Sequent rules 25
Set of support 87
Set of support, completeness 87
Set theory 234
Sign (of a formula) 107
Situation calculus 155 176
Situation frame 176
Skolem constants 80
Skolem Functions 80
Slot fillers (as default rules) 194
Sound labels in the ATMS 226
Soundness 20
Soundness of 20
Soundness of FOPC 43
Soundness of modal logic 126
STRIPS 155
Structural induction 17
Structural rule of game theoretic semantics 259
Structural rules 26
Tableau proofs 30
Tableau proofs for modal logic 132
Tableau systems 28
|
|
 |
Реклама |
 |
|
|