Sciweavers

2501 search results - page 22 / 501
» Logics with Rank Operators
Sort
View
FLAIRS
2006
13 years 9 months ago
Automated Generation of Interesting Theorems
In the logical theory of a set of axioms there are many boring logical consequences, and scattered among them there are a few interesting ones. The few interesting ones include th...
Yury Puzis, Yi Gao, Geoff Sutcliffe
MST
2011
206views Hardware» more  MST 2011»
13 years 3 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
RSCTC
1998
Springer
129views Fuzzy Logic» more  RSCTC 1998»
14 years 19 days ago
On Generalizing Pawlak Approximation Operators
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
Y. Y. Yao
IWINAC
2007
Springer
14 years 2 months ago
Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
Anthony Karel Seda
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
On M-Approximative Operators and M-Approximative Systems
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Alexander P. Sostak