Sciweavers

588 search results - page 34 / 118
» Minimality Results for the Spatial Logics
Sort
View
NPL
1998
129views more  NPL 1998»
13 years 8 months ago
Extraction of Logical Rules from Neural Networks
A new architecture and method for feature selection and extraction of logical rules from neural networks trained with backpropagation algorithm is presented. The network consists ...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...
MST
2006
120views more  MST 2006»
13 years 8 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
NMR
2004
Springer
14 years 2 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
CADE
2000
Springer
14 years 1 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
14 years 27 days ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ...
Huey-Yih Wang, Robert K. Brayton