Advances in Artificial Intelligence: Third Congress of the Italian Association for Artificial Intelligence, AI*IA `93, Torino, Italy, October 26-28, 1993. ProceedingsPietro Torasso Springer Science & Business Media, 5 de out. de 1993 - 336 páginas This book contains 22 long papers and 13 short ones selected for the Scientific Track of the Third Congress of the Italian Association for Artificial Intelligence. The long papers report completed work whereas the short papers are mainly devoted to ongoing research. The papers report significant work carried out in the different subfields of artificial intelligence not only in Italy but also elsewhere: 8 of the papers come from outside Italy, with 2 from the United States and 1 eachfrom Australia, Austria, Germany, The Netherlands, Spain, and Turkey. The papers in the book are grouped into parts on: automated reasoning; cognitive models; connectionist models and subsymbolic approaches; knowledge representation and reasoning; languages, architectures and tools for AI; machine learning; natural language; planning and robotics; and reasoning about physical systems and artifacts. |
Conteúdo
I | 1 |
V | 11 |
VIII | 23 |
X | 35 |
XI | 41 |
XIII | 47 |
XVI | 59 |
XVII | 65 |
XXXII | 160 |
XXXIII | 166 |
XXXIV | 178 |
XXXVI | 190 |
XXXVII | 202 |
XXXVIII | 208 |
XXXIX | 218 |
XL | 230 |
XVIII | 71 |
XIX | 84 |
XXI | 90 |
XXIII | 96 |
XXIV | 102 |
XXVI | 108 |
XXVII | 120 |
XXVIII | 132 |
XXIX | 142 |
XXX | 154 |
XLI | 242 |
XLIII | 254 |
XLIV | 266 |
XLV | 272 |
XLVI | 278 |
XLVII | 290 |
XLVIII | 302 |
XLIX | 314 |
LII | 326 |
Outras edições - Ver todos
Termos e frases comuns
3-valued stable models action agents application approach architecture Artificial Intelligence ATMS autoepistemic autoepistemic logic backpropagation basic behavior boundary webs complete component computational consider consistent constraint network constraint propagation Constraint Satisfaction Problems corresponding default default logic defined definition denote described disjunction domain environment example formal formula function Genetic Algorithms GETFOL given goal hole Horn clauses hypothesis implementation induction inference inference rules input instance interaction intervals knowledge base knowledge representation labeling literals logic program logical implication Machine Learning minimal Neural Networks nodes object paper parameters performed possible predicate prime implicants problem Proc proof strategies propagation propositional reasoning refinement operators relations relevant represent resource robot rules satisfied semantics Simulated Annealing solving space specified stable model semantics structure subsumption superquadric symbolic t₁ tactic terminological theorem theory Trento variables VITAL-KR