First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
Abstract—Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise, such as typing (covariance vs. contravariance of the argument...
- Symmetric level-index arithmetic was introduced to overcome the problems of overflow and underflow in scientific computations. A hybrid SLI-FLP number system, together with some ...
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...