450 search results - page 11 / 90 » Satisfiability with Exponential Families |
DCC
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
JUCS
2002
14 years 9 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
77
Voted
IJCAI
2001
14 years 10 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...