A General Framework for the Analysis of Sets of Constraints

DOI10.1142/9789812813220_0004zbMath1223.90033OpenAlexW2504347614MaRDI QIDQ3542360

Tim Traynor, Richard J. Caron

Publication date: 1 December 2008

Published in: Mathematical Programming and Game Theory for Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812813220_0004

zbMATH Keywords

Optimizationredundancyset coveringpreprocessingirreducible infeasible systemsminimal infeasibility sets

Mathematics Subject Classification ID

Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (12)

Weak Rigidity Theory and Its Application to Formation Stabilization ⋮ Precise parameter synthesis for stochastic biochemical systems ⋮ Model Reduction for Nonlinear Systems by Balanced Truncation of State and Gradient Covariance ⋮ Ordinal Bayesian incentive compatibility in random assignment model ⋮ Generic separating sets for three-dimensional elasticity tensors ⋮ Stabilizability of Game-Based Control Systems ⋮ A formal proof of the expressiveness of deep learning ⋮ A formal proof of the expressiveness of deep learning ⋮ A note on linearly dependent symmetric matrices ⋮ On the analyticity of the Fredholm determinant ⋮ Dual Space Preconditioning for Gradient Descent ⋮ Causal Lie products of free fields and the emergence of quantum field theory

This page was built for publication: A General Framework for the Analysis of Sets of Constraints