Integrating cardinality constraints into constraint logic programming with sets
From MaRDI portal
Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites work
- {log}: A language for programming in logic with finite sets
- A decision procedure for restricted intensional sets
- A pearl on SAT and SMT solving in Prolog
- A set solver for finite set relation algebra
- An automatically verified prototype of the Tokeneer ID station specification
- Automated proof of Bell-LaPadula security properties
- Automated reasoning with restricted intensional sets
- Cardinal: a finite sets constraint solver
- Cardinality constraints for arrays (decidability results and applications)
- Collections, Cardinalities, and Relations
- Combining sets with cardinals
- Deciding Boolean algebra with Presburger arithmetic
- Decision Procedures for Multisets with Cardinality Constraints
- Decision procedures for theories of sets with measures
- Efficient automated reasoning about sets and multisets with cardinality constraints
- scientific article; zbMATH DE number 1641581 (Why is no real title available?)
- scientific article; zbMATH DE number 3715506 (Why is no real title available?)
- scientific article; zbMATH DE number 2086594 (Why is no real title available?)
- scientific article; zbMATH DE number 2090313 (Why is no real title available?)
- scientific article; zbMATH DE number 2243396 (Why is no real title available?)
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Logic and integer programming
- MUNCH -- automated reasoner for sets and multisets
- Reasoning with finite sets and cardinality constraints in SMT
- Set unification
- Sets with cardinality constraints in satisfiability modulo theories
- Solving \(\mathrm{LIA}^\star\) using approximations
- Solving quantifier-free first-order constraints over finite sets and binary relations
- The B-Book
- Verification of threshold-based distributed algorithms by decomposition to decidable logics
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Integrating cardinality constraints into constraint logic programming with sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027217)
