Sciweavers

1146 search results - page 18 / 230
» Finite cupping sets
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
CADE
2008
Springer
13 years 9 months ago
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
13 years 7 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta
DLT
2004
13 years 9 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
ICML
2010
IEEE
13 years 8 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes