• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel & pussel

Upp till 25% på utvalda nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Systemvetenskap och AI
    3. Artificiell intelligens

    Artificial Intelligence Through Search

    AvChris Thornton,Benedict Du Boulay

    Inbunden, Engelska, 1992

    1 675 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Fler format och utgåvor

    Häftad

    1 675 kr

    Beskrivning

    This textbook on artificial intelligence uses the unifying thread of search to bring together most of the major techniques used in symbolic artificial intelligence. The authors, aware of the pitfalls of being too general or too academic, have taken a practical approach in that they include program code to illustrate their ideas. Furthermore, code is offered in both POP-11 and Prolog, thereby giving a dual perspective, highlighting the merits of these languages. Each chapter covers one technique and divides up into three sections: a section which introduces the technique (and its usual applications) and suggests how it can be understood as a variant/generalization of search; a section which developed a "low"-level (POP-11) implementation; and a section which developes a high-level (Prolog) implementation of the technique. The authors also include useful notes on alternative treatments to the material, further reading and exercises.As a practical book it should be welcomed by a wide audience including those already experienced in AI, students with some backgrounds in programming who are taking an introductory course in AI, and lecturers looking for a practical textbook to use in their AI courses.

    Produktinformation

    • Utgivningsdatum:1992-11-30
    • Mått:210 x 297 x 26 mm
    • Vikt:918 g
    • Format:Inbunden
    • Språk:Engelska
    • Antal sidor:365
    • Upplaga:1992
    • Förlag:Kluwer Academic Publishers
    • ISBN:9780792318682

    Utforska kategorier

    • Artificiell intelligens inom Data och IT

    Innehållsförteckning

    • 1 Search-Related Techniques in AI.- Why search.- Objectives.- Problem-solving systems.- State space search and problem reduction.- Blind search and heuristic search.- Graphs and trees.- Organisation of the book.- Searching for a solution path in a state space.- Problem reduction.- A very brief comparison of POP-11 and Prolog.- Further reading.- 2 Simple State Space Search.- Path-finding.- Setting up the database.- Setting up the path-finding function.- The generality of search.- Search spaces and search trees.- Constructing an explicit representation of the search-tree.- Search graphs.- Node terminology.- Backwards v. forwards searching.- OR-tree search in Prolog.- Reading.- Exercises.- 3 State Space Search.- The water jugs problem.- Constructing successor nodes.- The problem space.- Searching for a solution path.- Problem space exploration strategies.- Breadth-first search.- Agendas.- Implementing depth-first search using an agenda.- Iterative deepening.- Water jugs in Prolog.- Agendas in Prolog.- Iterative deepening in Prolog.- Reading.- Exercises.- Notes.- 4 Heuristic State Space Search.- The 8-puzzle.- Constructing 8-puzzle successors.- Heuristic search.- Hill-climbing search.- Heuristic breadth-first search.- Ordered search and the A* Algorithm.- Heuristic Search in Prolog.- Reading.- Exercises.- Notes.- 5 Heuristic Search of Game Trees.- Computing successors in the game of nim.- Minimax evaluation.- Worked example.- Alpha-beta cutoffs.- Implementing a nim-playing program.- Minimaxing in Prolog.- Reading.- Exercises.- Notes.- 6 Problem Reduction (AND/OR-tree search).- Problem-reduction and the Tower of Hanoi.- Implementing arbitrary AND/OR-trees.- Implementing the AND/OR-tree search function.- Implementing planning as AND/OR-tree search.- Implementing reasoning asAND/OR-tree search.- Loops in the search space.- Solution tree.- The AND/OR search tree.- State space search and problem reduction.- Forward AND/OR-tree search.- Terminology.- Production systems.- AND/OR Search in Prolog.- Reading.- Exercises.- Notes.- 7 Planning (microworld search).- Operators.- Strategies for microworld search.- Implementing the new search function.- Difference tables.- Goal interactions.- Operators containing variables.- Simple plan finding in Prolog.- Reading.- Exercises.- 8 Parsing (search as analysis).- Solution trees as analyses.- Parsing.- Data-driven (bottom-up) parsing.- Building trees bottom-up.- Advantages of bottom-up search.- Backwards and forwards parsing in Prolog.- The Prolog grammar rule formalism.- Bottom-up parsing in Prolog.- Why is parsing useful.- Building a top-level interpreter.- Meaning in Prolog.- Reading.- Exercises.- 9 Expert Systems (probabilistic search).- Probabilistic rules.- Basic probability theory.- Fuzzy set theory.- MYCIN-like search.- Implementing certainty-factors.- Forwards or backwards.- Probabilistic search in Prolog.- Reading.- Exercises.- 10 Concept learning (description search).- Generalisation hierarchies.- Deriving extensions.- Quantifying generality.- Concept learning.- Implementing the generalisation mechanism.- The focussing algorithm.- Focussing in Prolog.- Generalisation as search.- Reading.- Exercises.- 11 Prolog (search as computation).- Search rules as predicates.- The use of variables in search rules.- Data structures.- Unification.- Implementing the unification matcher.- Machinery to deliver output.- The search function.- Programming in Toyplog.- A sample interaction with Toyplog.- Reading.- Exercises.- Notes.- References.- Appendix A: Introduction to POP-11.- Starting POP-11.- POP-11 as a calculator.- Variables.- Functions.- Defining functions.- Local variables.- Boolean expressions.- Conditionals.- Words and lists.- Hats.- For loops.- Applist.- Syssort.- Matching.- Restriction procedures.- The matcher arrow.- The database.- Readline.- Functions calling functions.- Recursion.- Tracing.- Showtree.- Exiting from a function.- Partial application.- Concluding comment.- Appendix B Where to get the source code.