Proceedings of the ... Annual National Conference on Artificial Intelligence, Volume 14AAAI, 1997 - Artificial intelligence |
From inside the book
Results 1-3 of 87
Page 172
... procedure for propositional temporal logic . The proof procedure is structured around se- mantic tableau augmented with connections , and we propose a number of connection - based strategies . The procedure achieves many of the benefits ...
... procedure for propositional temporal logic . The proof procedure is structured around se- mantic tableau augmented with connections , and we propose a number of connection - based strategies . The procedure achieves many of the benefits ...
Page 173
... procedure . We also develop a temporal notion of polarity , from which connec- tions can be generated . Based on the generalized subfor- mula property and temporal connections , an efficient de- cision procedure for PTL is generated and ...
... procedure . We also develop a temporal notion of polarity , from which connec- tions can be generated . Based on the generalized subfor- mula property and temporal connections , an efficient de- cision procedure for PTL is generated and ...
Page 474
... procedure procedure simp ( [ C1 , C2 , ... , Cn ] , D ) if max ( C ) and mar ( D ) are complementary then Da_res ( Cn , D ) ; return simp ( C1 , C2 , ... , Cn - 1 ] , D ) else if max ( Cn ) > max ( D ) then return simp ( [ C1 , C2 ...
... procedure procedure simp ( [ C1 , C2 , ... , Cn ] , D ) if max ( C ) and mar ( D ) are complementary then Da_res ( Cn , D ) ; return simp ( C1 , C2 , ... , Cn - 1 ] , D ) else if max ( Cn ) > max ( D ) then return simp ( [ C1 , C2 ...
Contents
Agent Architecture | 3 |
Language and Learning | 10 |
Agent Coordination | 16 |
Copyright | |
53 other sections not shown
Other editions - View all
Common terms and phrases
3SAT Abstract action agents algorithm applied approach arc-consistency Artificial Intelligence assignment axioms backtracking Bayesian network behavior Carnegie Mellon University causal CBASlack chatter clauses coloring complexity component Computer constraint satisfaction constraint satisfaction problems context dataset decision defined denoted described description logic distribution document domain dynamic emotion evaluation example expected value Figure formula function goal graph graph coloring GSAT heuristic commitments inference input literals local search logic Logic Programming method minimal node optimal paper parameters performance phase transition planning possible post-failure prob probability problem instances Proc procedure propagation propositional qualitative quasigroup random reasoning representation Research resource retrievable query robot robustness rule rule-base satisfied scheduling Selman semantics sequence server simulation solution solve spatial specific strategies structure subgraph suffix tree SumHeight techniques temporal Theorem theory tion tree University unsatisfiable variables WSAT www.aaai.org