Abstract
The paper covers a wide range of knowledge acquisition, knowledge engineering and Machine Learning. The main idea is to unify a lot of AI problems using set-theoretic concepts and logical functions.
Many concepts of knowledge-based problem-solving are incorporated into one system which has been based on set-theoretical concepts. This results in a consisting methodology and in a comprehensive set of tools applicable in many fields. The transition between fuzzy and non-fuzzy parts of the problem domain can be realized very flexible supplying a high smartness and a high performance of the constructed model.
Part A of the paper shows the basis for different Machine Learning methods using logical equations. Part B gives a way how to use optimal strategies in order to obtain complete knowledge. A few examples illustrate the method.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Anthony and N. Biggs. Computational Learning Theory. An Introduction. Cambridge University Press, Cambridge, 1992.
D. F. Beal and M. R. B. Clarke. The Construction of Economical and Correct Algorithms for King and Pawn against King. In M. R. B. Clarke, editor, Advances in Computer Chess 2, pages 1–30, Edinburgh, Scotland, 1980. Edinburgh Univ. Press.
D. Bochmann and Chr. Posthoff. Binäre dynamische Systeme. Akademie-Verlag, Berlin, 1981.
D. Bochmann and B. Steinbach. Logikentwurf mit XBOOLE, Algorithmen und Programme. Verlag Technik GmbH, Berlin, 1991.
M. R. B. Clarke. A Quantitative Study of King and Pawn against King. In M. R. B. Clarke, editor, Advances in Computer Chess 1, pages 108–118, Edinburgh, Scotland, 1977. Edinburgh Univ. Press.
U. M. Fayyad and K. B. Irani. Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In 13th International Joint Conference on Artificial Intelligence, pages 1022–1027, San Mateo, 1993. Morgan Kaufmann Publ.
A. Heeffer. Automated Acquisition of Concepts for the Description of Middle-Game Positions in Chess. Technical Report No. TIRM-84-005, The Turing Institute, 1984.
H. Horacek. Some Conceptual Defects of Evaluation Functions. In T. O'Shea, editor, Proc. ECAI-84. Elsevier Science Publishers B.V., 1984.
I. S. Herschberg, H. J. van den Herik, and P. N. A. Schoo. Verifying and Codifying Strategies in the KNNKP(h) Endgame. ICCA Journal, 12(3):144–154, 1989.
J. Korst. Het genereren van regels voor schaak eindspelen ofwel eindspelen, moeilijker dan je denkt! Master's thesis, Technische Universität Delft, Delft, 1984.
R. Kurz. Musterverarbeitung bei der Schachprogrammierung. PhD thesis, Universität Stuttgart, Stuttgart, 1977.
D. Michie. King and Rook against King: Historical Background and a Problem on the Infinite Board. In M. R. B. Clarke, editor, Advances in Computer Chess 1, pages 30–59, Edinburgh, Scotland, 1977. Edinburgh Univ. Press.
R. S. Michalski and P. Negri. An Experiment on Inductive Learning in Chess End Games, pages 175–192. Halstead Press, Ellis Horwood, Chichester, UK, 1977.
O. Najmann. Techniques and Heuristics for Acquiring Symbolic Knowledge from Examples. PhD thesis, Universität-Gesamthochschule-, Paderborn, 1992.
Chr. Posthoff, C. Friedrich, D. Rätz, and O. Schumann. Zur Compilation von Wissensbasen. PROKON-Memo Nr. 1, TU Chemnitz, 1992.
Chr. Posthoff. Fuzzy Logics — New Concepts for Computer Chess? InH. J. van den Herik and V. Allis, editors, Heuristic Programming in Irtificial Intelligence 3. The Third Computer Olympiad, pages 88–101. Ellis Horwood, 1992.
Chr. Posthoff and M. Schlosser. Mengentheoretische Grundlagen für optimale Strategien beim Planen und Konfigurieren. In R. Bergmann, J. Paulokat, A.-M. Schoeller, and H. Wache, editors, Proc. 8. Workshop ”Planen und Konfigurieren”, Kaiserslautern, 18.–19. April 1994, pages 186–189. Universität und DFKI Kaiserslautern, 1994.
Chr. Posthoff, M. Schlosser, and R. Staudte. Wissensdarstellung und-verarbeitung in strategischen Spielen. Preprint Nr. 218, Juni 1992, TU Chemnitz, 1992.
Chr. Posthoff, M. Schlosser, R. Staudte, and J. Zeidler. Transformations of Knowledge. In H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors, Advances in Computer Chess 7, pages 177–202, Maastricht, The Netherlands, 1994. University of Limburg.
Chr. Posthoff, M. Schlosser, and J. Zeidler. Optimal strategies. In Proc. First European Congress on Fuzzy and Intelligent Technologies (EU-FIT'93), Aachen, September 7–10, pages 643–644, Aachen, 1993.
Chr. Posthoff, M. Schlosser, and J. Zeidler. Search vs. Knowledge?-Search and Knowledge! In Proc. 3rd KADS Meeting, March 8–9 1993, pages 305–326, Munich, 1993. SIEMENS AG, Corporate Research and Development.
J. R. Quinlan. Learning Efficient Classification Procedures and their Application to Chess End Games, pages 463–482. Morgan Kaufmann, Los Altos, Cal., 1983.
A. J. Roycroft. GBR Class 0023. EG, 6(83):12–15, 1986.
M. Schlosser. Computers and Chess Problem Composition. ICCA Journal, 11(4):51–55, 1988.
M. Schlosser. Can a Computer Compose Chess Problems? In D. F. Beal, editor, Advances in Computer Chess 6, pages 117–131, Chichester, UK, 1991. Ellis Horwood.
M. Schlosser. A Test-Bed for Investigations in Machine Learning. Gosler-Report No. 18, TH Leipzig, October 1992.
O. Schumann. Darstellung und Verarbeitung regelorientierter Wissensbasen mittels Boole scher Gleichungen. PhD thesis, TU ChemnitzZwickau, FB Informatik, Chemnitz, April 1994.
R. Seidel. Deriving Correct Pattern Descriptions and Rules for the KRK Endgame by Deductive Methods. In D. F. Beal, editor, Advances in Computer Chess 4, pages 19–36, Oxford, UK, 1986. Pergamon Press.
D. Steinwender. Bewertungsfunktionen in Schachprogrammen. Master's thesis, Fachbereich Informatik, Universität Hamburg, Hamburg, 1984.
T. Ströhlein. Untersuchungen über kombinatorische Spiele. PhD thesis, TU München, München, 1970.
L. G. Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134–1142, 1984.
E. Zermelo. Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In 5. Int. Mathematikerkongreβ, volume 2, pages 501–504, Cambridge, 1912.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Posthoff, C., Schlosser, M. (1995). Optimal strategies — Learning from examples — Boolean equations. In: Jantke, K.P., Lange, S. (eds) Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Computer Science, vol 961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60217-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-60217-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60217-0
Online ISBN: 978-3-540-44737-5
eBook Packages: Springer Book Archive