Mathematical fuzzy logic as a tool for the treatment of vague information
Information Sciences—Informatics and Computer Science: An International Journal
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
Fuzzy Sets and Systems
Optimizing hypergraph transversal computation with an anti-monotone constraint
Proceedings of the 2007 ACM symposium on Applied computing
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Mathematical fuzzy logic as a tool for the treatment of vague information
Information Sciences: an International Journal
The expressive power of valued constraints: hierarchies and collapses
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Proceedings of the forty-second ACM symposium on Theory of computing
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Explicit descriptions of bisymmetric Sugeno integrals
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A functional completeness theorem for De Morgan functions
Discrete Applied Mathematics
| Hi-index | 0.02 |
From the Publisher:This graduate-level textbook provides an introduction to the basic ideas and concepts of universal algebra and surveys of newer developments. Universal Algebra and Applications in Theoretical Computer Science is written in a style accessible to beginners, with every new concept clearly explained and numerous examples provided. The main ideas of concept lattices as an important tool for conceptual analysis of data are developed, and several examples are given. The algebraic theory of tree automata and its interconnections to universal-algebraic concepts are described. The final part of the book is devoted to key applications of universal algebra in theoretical computer science.