Sciweavers

851 search results - page 83 / 171
» Inaccessibility in Decision Procedures
Sort
View
CHI
2008
ACM
14 years 9 months ago
Experience sampling for building predictive user models: a comparative study
Experience sampling has been employed for decades to collect assessments of subjects' intentions, needs, and affective states. In recent years, investigators have employed au...
Ashish Kapoor, Eric Horvitz
LATA
2010
Springer
14 years 6 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
FMCAD
2009
Springer
14 years 3 months ago
Mixed abstractions for floating-point arithmetic
stractions for Floating-Point Arithmetic Angelo Brillout Computer Systems Institute, ETH Zurich Daniel Kroening and Thomas Wahl Oxford University Computing Laboratory Abstract—Fl...
Angelo Brillout, Daniel Kroening, Thomas Wahl
CL
2000
Springer
14 years 1 months ago
The Taming of the (X)OR
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
Peter Baumgartner, Fabio Massacci
FROCOS
2007
Springer
14 years 26 days ago
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
Roberto Sebastiani