Consistency of relations over monoids

DOI10.1145/3721855MaRDI QIDQ6939380zbMATH OpenFDO

Authors Albert Atserias, Phokion G. Kolaitis

Publication date 21 August 2025

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1145/3721855

zbMATH Keywords

acyclic hypergraphsglobal consistencylocal consistencypositive commutative monoidspositive semirings

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Database theory (68P15)

Cites work

• Algorithmic Aspects of Vertex Elimination on Graphs
• Automata, Languages and Programming
• Axiomatizing rational power series over natural numbers
• Classification of annotation semirings over containment of conjunctive queries
• Complexity of the Frobenius problem
• Consistency, acyclicity, and positive Semirings
• Containment of conjunctive queries on annotated relations
• Elements of automata theory. Translated from the French by Reuben Thomas
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• scientific article; zbMATH DE number 3019695 (Why is no real title available?)
• Numerical semigroups and applications
• Numerical semigroups.
• On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
• On the Desirability of Acyclic Database Schemes
• Simulations of weighted tree automata
• Testing the universal instance assumption

This page was built for publication: Consistency of relations over monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939380)