Sciweavers

2018 search results - page 10 / 404
» Code Normal Forms
Sort
View
AUTOMATICA
2004
85views more  AUTOMATICA 2004»
13 years 9 months ago
Non-regular feedback linearization of nonlinear systems via a normal form algorithm
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
Daizhan Cheng, Xiaoming Hu, Yuzhen Wang
TCS
2011
13 years 4 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
AAAI
2010
13 years 7 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
IPL
2007
69views more  IPL 2007»
13 years 9 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen
VLSID
2007
IEEE
153views VLSI» more  VLSID 2007»
14 years 10 months ago
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik