2018 search results - page 178 / 404 » Code Normal Forms |
114
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
122
click to vote
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...
122
click to vote
MEMOCODE
2010
IEEE
15 years 25 days ago
2010
IEEE
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
180
click to vote
FLAIRS
2009
15 years 22 days ago
2009
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
149
click to vote
MA
2011
Springer
14 years 10 months ago
2011
Springer
The asymptotic properties of the quasi-maximum likelihood estimator (QMLE) of vector autoregressive moving-average (VARMA) models are derived under the assumption that the errors ...