Tractable constraints in finite semilattices

DOI10.1016/S0167-6423(99)00011-8zbMATH Open0948.68017OpenAlexW2005978190MaRDI QIDQ1818076FDOQ1818076

Jakob Rehof, Torben Ægidius Mogensen

Publication date: 4 January 2000

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(99)00011-8

zbMATH Keywords

meet-semilatticedefinite inequality constraintsHorn-clauses

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited In (6)

• OntCheck: an ontology-driven static correctness checking tool for component-based models
• SVARs with occasionally-binding constraints
• The design and application of structured types in Ptolemy II
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• On assertion-based encapsulation for object invariants and simulations
• Tractable constraints in finite semilattices

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

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