Sciweavers

2035 search results - page 225 / 407
» On the complexity of stratified logics
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
AAI
2006
71views more  AAI 2006»
15 years 6 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
ENTCS
2006
213views more  ENTCS 2006»
15 years 6 months ago
Building Components from Functions
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
Bernhard Schäz
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 6 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
JSYML
2006
76views more  JSYML 2006»
15 years 6 months ago
Diagonal actions and Borel equivalence relations
We investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence rela...
Longyun Ding, Su Gao