86 search results - page 6 / 18 » Satisfiability Algorithms and Finite Quantification |
DBPL
2007
Springer
15 years 1 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
96
Voted
AGP
1999
IEEE
15 years 1 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...