Sciweavers

136 search results - page 6 / 28
» Boolean Formulas and Frequent Sets
Sort
View
CADE
2007
Springer
15 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
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...
Viktor Kuncak, Martin C. Rinard
ECAI
2006
Springer
15 years 1 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
CORR
2010
Springer
88views Education» more  CORR 2010»
14 years 9 months ago
A fuzzified BRAIN algorithm for learning DNF from incomplete data
Aim of this paper is to address the problem of learning Boolean functions from training data with missing values. We present an extension of the BRAIN algorithm, called U-BRAIN (U...
Salvatore Rampone, Ciro Russo
JAR
2006
236views more  JAR 2006»
14 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
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...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
FROCOS
2009
Springer
15 years 4 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak