Solving linear constraints over real and rational fields

Authors:
V. N. German
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 10
Cited 0

A canonical form for generalized linear constraints

Journal of Symbolic Computation
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields

Mathematical Programming: Series A and B
Practical tools for reasoning about linear constraints

Fundamenta Informaticae - Special issue: logics for artificial intelligence
Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences

IEEE Transactions on Parallel and Distributed Systems
A subexponential exact learning algorithm for DNF using equivalence queries

Information Processing Letters
Querying constraints

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Cassowary linear arithmetic constraint solving algorithm

ACM Transactions on Computer-Human Interaction (TOCHI)
Learning DNF by Approximating Inclusion-Exclusion Formulae

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Learning DNF in time 2õ(n1/3)

Journal of Computer and System Sciences - STOC 2001
Using linear models in optimizing parameters of time-triggered protocols

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Practical methods are proposed to solve linear constraints over real and rational fields with quantifiers. Secondary problems are observed together with the set of possible solutions in the context of automatic software model verification.