Learning union of integer hypercubes with queries (with applications to monadic decomposition)

DOI10.1007/978-3-030-81688-9_12zbMath1493.68170arXiv2105.13071OpenAlexW3186357476MaRDI QIDQ832265

Oliver Markgraf, Daniel Stan, Anthony Widjaja Lin

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2105.13071

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic in computer science (03B70)

Uses Software

• z3

Cites Work

• Unnamed Item
• Decision procedures. An algorithmic point of view
• Learning regular sets from queries and counterexamples
• Learning semilinear sets from examples and via queries
• On the number of prime implicants
• Algorithms and lower bounds for on-line learning of geometrical concepts
• Characterizing PAC-learnability of semilinear sets
• The learnability of unions of two rectangles in the two-dimensional discretized space
• When won't membership queries help?
• Parameterized synthesis with safety properties
• Monadic decomposition in integer linear arithmetic
• The power of symbolic automata and transducers
• Queries and concept learning
• Decision problems among the main subfamilies of rational relations
• Learning Minimal Separating DFA’s for Compositional Verification
• Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
• Monadic Decomposition
• Variable independence for first-order definable constraints
• A constraint-based approach to solving games on infinite graphs
• An optimal algorithm for proper learning of unions of two rectangles with queries

This page was built for publication: Learning union of integer hypercubes with queries (with applications to monadic decomposition)