Unification in finite algebras is unitary(?)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 310 LNCS, Issue , 1988, Pages 368-377

  Büttner, Wolfram ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

APPLICATION-ORIENTED; FINITE ALGEBRAS; LEVEL DESIGN; POSTALGEBRAS; UNIFICATION ALGORITHMS;

ALGEBRA;

EID: 84947914621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0012844     Document Type: Conference Paper

References (10)

1. Baader F., Unification in Idempotent Semigroups is of Type Zero, JAR2, 1986
2. Balbes R. and Dwinger P., Distributive Lattices, University of Missouri Press, Columbia, U.S.A., 1974
3. Bryant R. Graph-Based Algorithms for Boolean Functions Manipulations, IEEE Transactions on Computers, Vol. C-35, No. 8, pg. 677–691, 1986
4. Büttner W. and Simonis H., Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation (to appear 1987)
5. Büttner W. Application Driven Prolog Extensions, Submitted to International Symposium on Multiple-Valued Logic, Palma de Mallorca, Spain, May 1988
6. Nipkow T., Unification in Functionally Complete Algebras, Unpublished Manuscript 1987, Dept. CS, University of Manchester, England
7. Plotkin G., Building in Equational Theories, Machine Intelligence 7, pg. 73–90, 1972
8. Siekmann J., Unification Theory, Proceedings, European Conference on Artificiallntelligence, Brighton, England, July 1986
9. Rosenberg I. and Schweigert D., Compatible Ordesings and Tolerances of Lattices, Preprint No. 70, Dept. of Mathematics, University of Kaiserslautern, West Germany, 1984
10. Simonis H., Using Extended Prolog to Model Digital Circuits, Technical Report TR-LP-2202 E.C.R.C.(European Computer Industry Research Centre), 1986