|
|
|||
|
||||
OverviewThis handbook surveys the computational and algorithmic problems of systems of applied reasoning. The various theoretical and modelling aspects of defeasible reasoning were dealt with in the first four volumes, and this volume now turns to the algorithmic aspect. Topics covered include: Computation in valuation algebras; consequence finding algorithms; possibilistic logic; probabilistic argumentation systems, networks and satisfiability; algorithms for imprecise probabilities, for Dempster-Shafer, and network based decisions. Full Product DetailsAuthor: Dov M. Gabbay , Philippe SmetsPublisher: Springer Imprint: Springer Edition: 2001 ed. Volume: 5 Dimensions: Width: 15.60cm , Height: 2.80cm , Length: 23.40cm Weight: 2.030kg ISBN: 9780792366720ISBN 10: 0792366727 Pages: 517 Publication Date: 31 December 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsVolume Introduction.- I: Fundamentals.- Computation in Valuation Algebras.- Consequence Finding Algorithms.- II: Algorithms for Logical Formalisms.- Computing Specificity in Default Reasoning.- Possibilistic Logic: Complexity and Algorithms.- Probabilistic Argumentation Systems.- III: Algorithms for Numerical Formalisms.- Probabilistic Networks.- Probabilistic Satisfiability.- Algorithms for Imprecise Probabilities.- Algorithms for Dempster—Shafer Theory.- Network-based Decision Algorithms.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |