登入選單
返回Google圖書搜尋
其他書名
From Decision Procedures to Declarative Programming with Sets
出版Springer Science & Business Media, 2013-06-29
主題Computers / Computer ScienceComputers / Languages / GeneralComputers / Data Science / GeneralMathematics / LogicComputers / Information TechnologyMathematics / Discrete Mathematics
ISBN14757345229781475734522
URLhttp://books.google.com.hk/books?id=KWvlBwAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋"Set Theory for Computing" provides a comprehensive account of set-oriented symbolic manipulation methods suitable for automated reasoning. Its main objective is twofold: 1) to provide a flexible formalization for a variety of set languages, and 2) to clarify the semantics of set constructs firmly established in modern specification languages and in the programming practice. Topics include: semantic unification, decision algorithms, modal logics, declarative programming, tableau-based proof techniques, and theory-based theorem proving. The style of presentation is self-contained, rigorous and accurate. Some familiarity with symbolic logic is helpful but not a requirement. This book is a useful resource for all advanced students, professionals, and researchers in computing sciences, artificial intelligence, automated reasoning, logic, and computational mathematics. It will serve to complement their intuitive understanding of set concepts with the ability to master them by symbolic and logically based algorithmic methods and deductive techniques.