Advances in Artificial Intelligence
Editat de Pietro Torassoen Limba Engleză Paperback – 5 oct 1993
Preț: 325.03 lei
Preț vechi: 406.29 lei
-20%
Puncte Express: 488
Carte tipărită la comandă
Livrare economică 27 mai-10 iunie
Specificații
ISBN-13: 9783540572923
ISBN-10: 3540572929
Pagini: 356
Ilustrații: XIII, 343 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540572929
Pagini: 356
Ilustrații: XIII, 343 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Proving formulas through reduction to decidable classes.- Building and executing proof strategies in a formal metatheory.- Computing 3-valued stable models by using the ATMS.- Abstract properties for the choice provability relation in nonmonotonic logics.- Characterizing prime implicants as projective spaces.- EFH-Soar: Modeling education in highly interactive microworlds.- Foundations for interaction: The dependence theory.- Letter spirit: An architecture for creativity in a microdomain.- New systems for extracting 3-D shape information from images.- Projecting sub-symbolic onto symbolic representations in artificial neural networks.- Integrating the symbolic and the sub-symbolic level in sonar-based navigation.- Randomness, imitation or reason explain agents' behaviour into an artificial stock market?.- Neural networks for constraint satisfaction.- Reasoning with individuals in concept languages.- A family of temporal terminological logics.- Logic programming and autoepistemic logics: New relations and complexity results.- Inferring in lego-land: an architecture for the integration of heterogeneous inference modules.- MAP — a language for the modelling of Multi-Agent systems.- Developing co-operating legal knowledge based systems.- Negation as a specializing operator.- Constructing refinement operators by decomposing logical implication.- Learning relations: Basing top-down methods on inverse resolution.- Complexity of the CFP, a method for Classification based on Feature Partitioning.- Genetic algorithms elitist probabilistic of degree 1, a generalization of simulated annealing.- Learning relations using genetic algorithms.- Evolutionary learning for relaxation labeling processes.- Increasing cohesion in automatically generated natural language texts.- Productionof cooperative answers on the basis of partial knowledge in information-seeking dialogues.- Coping with modifiers in a restricted domain.- Explanation strategies in a tutoring system.- Maintaining consistency in quantitative temporal constraint networks for planning and scheduling.- Making an autonomous robot plan temporally constrained maintenance operations.- A generative constraint formalism for configuration problems.- Selecting observation time in the monitoring and interpretation of time-varying data.- Spatial reasoning in a holey world.