Atjaunināt sīkdatņu piekrišanu

Tractable Reasoning in Aritificial Intelligence 1995 ed. [Mīkstie vāki]

  • Formāts: Paperback / softback, 286 pages, height x width: 235x155 mm, weight: 860 g, X, 286 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Artificial Intelligence 941
  • Izdošanas datums: 18-Jul-1995
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540600582
  • ISBN-13: 9783540600589
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 286 pages, height x width: 235x155 mm, weight: 860 g, X, 286 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Artificial Intelligence 941
  • Izdošanas datums: 18-Jul-1995
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540600582
  • ISBN-13: 9783540600589
Citas grāmatas par šo tēmu:
Logic is one of the most popular approaches to artificial intelligence. A potential obstacle to the use of logic is its high computational complexity, as logical inference is an extraordinarily powerful computational device.
This book is concerned with computational aspects of the logical approach to AI. The focus is on two strategies for achieving computational tractability in knowledge representation and reasoning by language restriction and approximation. Several formalisms for knowledge representation are taken into account; among the computational problems studied are checking satisfiability and entailment of formulae, finding a model, and approximating and compiling a logical for

Papildus informācija

Springer Book Archives
Language restriction: Complexity of minimal reasoning.- Approximation of
a logical theory.- Using complexity results for evaluating approximation
techniques.- Conclusion.