Tractable constraints in finite semilattices

DOI10.1016/S0167-6423(99)00011-8MaRDI QIDQ1818076zbMATH OpenOpenAlexFDO

Authors 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

definite inequality constraintsHorn-clausesmeet-semilattice

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Tractable constraints in finite semilattices
• Tractable constraints on ordered domains
• Constraint satisfaction tractability from semi-lattice operations on infinite sets
• Characterising tractable constraints
• scientific article; zbMATH DE number 1944123

Cited in

(9)

• SVARs with occasionally-binding constraints
• OntCheck: an ontology-driven static correctness checking tool for component-based models
• On assertion-based encapsulation for object invariants and simulations
• The design and application of structured types in Ptolemy II
• Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
• scientific article; zbMATH DE number 978246 (Why is no real title available?)
• Tractable constraints in finite semilattices
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• On weak positive predicates over a finite set

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)