Sciweavers

2062 search results - page 147 / 413
» Derivatives of Logical Formulas
Sort
View
CAV
2008
Springer
89views Hardware» more  CAV 2008»
15 years 6 months ago
Inferring Congruence Equations Using SAT
This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, wh...
Andy King, Harald Søndergaard
LWA
2004
15 years 5 months ago
Learning Prototype Ontologies by Hierachical Latent Semantic Analysis
An ontology is a speci...cation of a conceptualization, a shared understanding of some domain of interest. The paper develops an algorithm that hierarchically groups words together...
Gerhard Paaß, Jörg Kindermann, Edda Leo...
PE
2006
Springer
85views Optimization» more  PE 2006»
15 years 4 months ago
Loss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptio...
Fumio Ishizaki
CADE
2007
Springer
16 years 4 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
CIE
2007
Springer
15 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer