Franklin

Logic versus Approximation [electronic resource] : Essays Dedicated to Michael M. Richter on the Occasion of His 65th Birthday / edited by Wolfgang Lenski.

Edition:
1st ed. 2004.
Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 3075
Lecture Notes in Computer Science, 0302-9743 ; 3075
Format/Description:
Book
1 online resource (X, 203 pages)
Subjects:
Logic, Symbolic and mathematical.
Artificial intelligence.
Algorithms.
Numerical analysis.
Computer science-Mathematics.
Database management.
Local subjects:
Mathematical Logic and Formal Languages. (search)
Artificial Intelligence. (search)
Algorithm Analysis and Problem Complexity. (search)
Numeric Computing. (search)
Discrete Mathematics in Computer Science. (search)
Database Management. (search)
System Details:
text file PDF
Summary:
Nowadays knowledge-based systems research and development essentially employs two paradigms of reasoning. There are on the one hand the logic-based approaches where logic is to be understood in a rather broad sense; usually these approaches are used in symbolic domains where numerical calculations are not the core challenge. On the other hand we find approximation oriented reasoning; methods of these kinds are mainly applied in numerical domains where approximation is part of the scientific methodology itself. However, from an abstract level all these approaches do focus on similar topics and arise on various levels such as problem modeling, inference and problem solving techniques, algorithms and mathematical methods, mathematical relations between discrete and continuous properties, and are integrated in tools and applications. In accordance with the unifying vision and research interest of Michael M. Richter and in correspondence to his scientific work, this book presents 13 revised full papers advocating the integration of logic-based and approximation-oriented approaches in knowledge processing.
Contents:
A True Unprovable Formula of Fuzzy Predicate Logic
The Inherent Indistinguishability in Fuzzy Systems
On Models for Quantified Boolean Formulas
Polynomial Algorithms for MPSP Using Parametric Linear Programming
Discrete and Continuous Methods of Demography
Computer Science between Symbolic Representation and Open Construction
Towards a Theory of Information
Retrieval by Structure from Chemical Data Bases
Engineers Don't Search
Randomized Search Heuristics as an Alternative to Exact Optimization
Approximation of Utility Functions by Learning Similarity Measures
Knowledge Sharing in Agile Software Teams
Logic and Approximation in Knowledge Based Systems.
Contributor:
Lenski, Wolfgang. editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-540-25967-1
9783540259671
Publisher Number:
10.1007/b98383 doi
Access Restriction:
Restricted for use by site license.
Loading...
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy