Abstract
An outline for the study of invariant theoretic (as structural) and completion (as syntactical) concepts in symbolic computation and artificial intelligence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artificial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.
Supported by the Austrian Ministry for Science and Research.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lang, S., (1984). Algebra. Addison-Wesley.
Rota G.-C., Sturmfels B., (1988). Introduction to Invariant Theory in Superalgebras. Invariant Theory and Tableaux, ed., Stanton, D., Springer.
Kalman, R., Arbib, M., Falb, P., (1965). Topics in Mathematical System Theory, McGraw-Hill.
Kleene, S., (1967). Introduction to Metamathematics. North-Holland.
Pfalzgraf, J., (1991). Logical Fiberings and Polycontextural Systems. In: Fundamentals of Artificial Intelligence Research, eds., Jorrand, Ph., Kelemen, J., LNCS 535, Springer.
Jacobson, N., (1980). Basic Algebra II. Freeman.
Jouannaud, J-P., (1990). Syntactic Theories. In: Mathematical Foundations of Computer Science, ed., Rovan, B., LNCS 452, Springer.
Dershowitz, N., Jouannaud, J.-P. (1990). Rewrite Systems. In: Handbook of Theoretical Computer Science. Vol B: Formal Methods and Semantics, ed., van Leeuwen, J., North-Holland.
Goguen, J., (1986). What Is Unification? In: Resolution of Equations in Algebraic Structures. Vol. 1: Algebraic Techniques, eds., Nivat, M., Ait-Kaci, H., Academic Press.
Buchberger, B., (1987). History and Basic Features of the Critical-pair/completion Procedure. J. Symbolic-Computation, 3.
Buchberger, B., (1976). A Theoretical Basis for the Reduction of Polynomials to Canonical Form. ACM SIGSAM Bull., 10.
Winkler, F., (1984). The Church-Rosser Property in Computer Algebra and Special Theorem Proving. PhD Thesis, University. of Linz.
Huet, G., (1987). Deduction and Computation. In: Logic of Programming and Calculi of Discrete Design, ed., Broy, M., Springer.
Nilsson, N., (1971). Problem Solving Methods in Artificial Intelligence. McGrawHill.
Engeler, E., (1990). Combinatory Differential Fields, Theoretical Computer Science 72.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ardeleanu, E.E. (1993). Completion and invariant theory in symbolic computation and artificial intelligence. In: Calmet, J., Campbell, J.A. (eds) Artificial Intelligence and Symbolic Mathematical Computing. AISMC 1992. Lecture Notes in Computer Science, vol 737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57322-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-57322-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57322-7
Online ISBN: 978-3-540-48063-1
eBook Packages: Springer Book Archive