Sciweavers

1146 search results - page 24 / 230
» Finite cupping sets
Sort
View
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
A Translational Approach to Constraint Answer Set Solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
Christian Drescher, Toby Walsh
BSL
2008
97views more  BSL 2008»
13 years 7 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
ICANN
2010
Springer
13 years 8 months ago
Neuro-symbolic Representation of Logic Programs Defining Infinite Sets
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
Ekaterina Komendantskaya, Krysia Broda, Artur S. d...
KDD
2002
ACM
108views Data Mining» more  KDD 2002»
14 years 8 months ago
Incremental Machine Learning to Reduce Biochemistry Lab Costs in the Search for Drug Discovery
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...
George Forman
ICALP
2009
Springer
14 years 8 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal