A decision procedure for sets, binary relations and partial functions
From MaRDI portal
Recommendations
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
- A decision procedure for restricted intensional sets
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
Cited in
(9)- Handling transitive relations in first-order automated reasoning
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Decision procedures for theories of sets with measures
- A decision procedure for restricted intensional sets
- Automated reasoning with restricted intensional sets
- Decision functions and characterization of their properties
- Reasoning with finite sets and cardinality constraints in SMT
- scientific article; zbMATH DE number 6130163 (Why is no real title available?)
- scientific article; zbMATH DE number 7552282 (Why is no real title available?)
This page was built for publication: A decision procedure for sets, binary relations and partial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633533)