112 search results - page 8 / 23 » On the Expressiveness of Levesque's Normal Form |
CP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
PEPM
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
CSDA
2011
13 years 2 months ago
2011
Estimating an overall density function from repeated observations on each of a sample of independent subjects or experimental units is of interest. An example is provided by biodem...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—In this paper, a novel error probability analysis of orthogonal space-time block coding (OSTBC) over independent but not necessarily identical Hoyt (Nakagami-q) fading channels ...
IJCAI
2001
13 years 8 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...