1916 search results - page 100 / 384 » Reasoning with class algebra |
86
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
TCOM
2008
15 years 18 days ago
2008
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic...
116
Voted
IJCAI
2003
15 years 2 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
115
click to vote
IJCAI
1997
15 years 2 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
118
Voted
SYNASC
2008
IEEE
15 years 7 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...