2062 search results - page 183 / 413 » Derivatives of Logical Formulas |
112
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...
152
click to vote
RSCTC
2004
Springer
15 years 9 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
121
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
159
click to vote
ICGI
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
119
click to vote
HYBRID
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. We present a language,Hybrid cc, for modeling hybrid systems compositionally. This language is declarative, with programs being understood as logical formulas that place ...