Tractable constraints in finite semilattices

DOI10.1007/3-540-61739-6_48zbMath1482.68093OpenAlexW1603787713MaRDI QIDQ5030199

Jakob Rehof, Torben Ægidius Mogensen

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_48

zbMATH Keywords

algorithmsprogram analysistractabilityfinite semilatticesconstraint satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semilattices (06A12)

Cites Work

• Model theory.
• Structure identification in relational data
• Tractable constraints in finite semilattices
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The complexity of satisfiability problems
• Tractable constraints on ordered domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tractable constraints in finite semilattices