Abstract
Universal algebra has underpinned the modern research in formal logic since Garrett Birkoff’s pioneering work in the 1930’s and 1940’s. Since the early 1970’s, the entanglement of logic and algebra has been successfully exploited in many areas of computer science from the theory of computation to Artificial Intelligence (AI).
The scientific outcome of the interplay between logic and universal algebra in computer science is rich and vast (cf. [2]). In this presentation I shall discuss some applications of universal algebra in AI with an emphasis on Knowledge Representation and Reasoning (KRR).
A brief survey, such as this, of possible ways in which the universal algebra theory could be employed in research on KRR systems, has to be necessarily incomplete. It is primarily for this reason that I shall concentrate almost exclusively on propositional KRR systems. But there are other reasons too. The outburst of research activities on stochastic local search for propositional satisfiability that followed the seminal paper A New Method for Solving Hard Satisfiability Problems by Selman, Levesque, and Mitchel (cf. [11]), provides some evidence that propositional techniques could be surprisingly effective in finding solutions to ‘realistic’ instances of hard problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blok, W.J., Pigozzi, D.: Algebraizable Logics. Memoirs of the American Mathematical Society, vol. 77(396) (1989)
Denecke, K., Wismath, S.L.: Universal Algebra and Applications in Computer Science. Chapman & Hall/CRC (2002)
Fitting, M., Orłowska, E. (eds.): Beyond Two: Theory and Applications of Multiple-Valued Logic. Studies in Fuzziness and Soft Computing. Phisica-Verlag, Heidelberg (2003)
Fitting, M.: Bilattices and the semantics of logic programming. Journal of Logic Programming 11, 91–116 (1991)
Ginsberg, M.L.: Multivalued logics: a uniform approach to reasoning in artificial intelligence. Comput. Intell. 5, 265–316
Hähnle, R.: Automated Deduction in Multiple-Valued Logics. Clarendon Press, Oxford (1993)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artificial Intelligence 44, 167–207 (1990)
Makinson, D.: General Patterns in Nonmonotonic Reasoning. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming: Nonmonotonic and Uncertain Reasoning, vol. 3, Oxford University Press, Oxford (1994)
Przymusinski, T.: Three-Valued Non-Monotonic Formalisms and Logic Programming”. In: Proc. of the First Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 1989), Toronto, pp. 341–348 (1989)
Rasiowa, H.: An Algebraic Approach to Non-Classical Logics. North-Holland, Amsterdam (1974)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proc. AAAI 1992, pp. 440–446 (1992)
Stachniak, Z.: Polarity-based Stochastic Local Search Algorithm for Non-clausal Satisfiability. In: [3], pp. 181–192 (2002)
Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer, Dordrecht (1996)
Stachniak, Z.: Nonmonotonic Theories and Their Axiomatic Varieties. J. of Logic, Language, and Computation 4(4), 317–334 (1995)
Thistlewaite, P.B., McRobbie, M.A., Meyer, R.K.: Automated Theorem-Proving in Non-Classical Logics. Pitman (1988)
Wójcicki, R.: Theory of Logical Calculi: Basic Theory of Consequence Operations. Kluwer, Dordrecht (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stachniak, Z. (2004). Finite Algebras and AI: From Matrix Semantics to Stochastic Local Search. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30210-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23212-4
Online ISBN: 978-3-540-30210-0
eBook Packages: Springer Book Archive