Proceedings of the Seventh Conference of the Society for the Study of Artificial Intelligence and Simulation of Behaviour |
From inside the book
Results 1-3 of 91
Page 134
... definition 6 . Two further conditions are required for a tran- sition sequence to constitute a taut path , corre- sponding to the two clauses in definition 3 : Definition 7 A transition sequence [ 00 , 01 , ... , OM ] is said to be taut ...
... definition 6 . Two further conditions are required for a tran- sition sequence to constitute a taut path , corre- sponding to the two clauses in definition 3 : Definition 7 A transition sequence [ 00 , 01 , ... , OM ] is said to be taut ...
Page 176
... Definition 3 a ≤ b ↔ a ≤ bλ ( a = set b ) Definition 4 : a € 2b ↔ a ≤ b Definition 5 : a E Ø ↔ 1 Figure 1 : Set theory definitions from [ Plu87 ] an equivalence to the defining expression . Predicate . definitions are of the form ...
... Definition 3 a ≤ b ↔ a ≤ bλ ( a = set b ) Definition 4 : a € 2b ↔ a ≤ b Definition 5 : a E Ø ↔ 1 Figure 1 : Set theory definitions from [ Plu87 ] an equivalence to the defining expression . Predicate . definitions are of the form ...
Page 182
... definition ahead . “ C ” in the hypothesis needs to be unfolded into “ C ” and “ = set " . The “ ç ” then needs to be unfolded to give a common currency , “ E ” with the conclusion . Example 3 : the theoremt a = set 0 + ( 3r . a = set a ) ...
... definition ahead . “ C ” in the hypothesis needs to be unfolded into “ C ” and “ = set " . The “ ç ” then needs to be unfolded to give a common currency , “ E ” with the conclusion . Example 3 : the theoremt a = set 0 + ( 3r . a = set a ) ...
Other editions - View all
Common terms and phrases
abstract action agent analogy Artificial Intelligence assumption axioms behaviour belief circumscription clauses Cognitive complete complex nodes Computer concept condition consistent constraint satisfaction problem constraints constructive negation context model counterfactual DATR decision tree declarative program default inferences defined definition DePlan domain dynamic environment example fgaze Figure forced paths formulas function gazing genetic algorithm given graph heuristics higher-level goals implementation instance instant coffee interval k-consistency Kahney knowledge base label Logic Programming mapping match minimal model theory negation as failure neural nextstate notion operators paper partial evaluation population preconditions predicate preference rule problem procedural program procedure proof propagation proposition prototype theory range reasoning recursion relations relationships representation represented robot satisfies schema semantics simulation sinusoidal solving specific state-space structure subgoals suppressed premises symbols task theorem theory extension tion values variables worldstate