Sciweavers

113 search results - page 19 / 23
» On bounded occurrence constraint satisfaction
Sort
View
IJCAI
2001
13 years 9 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
CADE
2006
Springer
14 years 8 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
LICS
2006
IEEE
14 years 1 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
CP
2007
Springer
14 years 1 months ago
Groupoids and Conditional Symmetry
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
Ian P. Gent, Tom Kelsey, S. A. Linton, J. Pearson,...
ILP
2007
Springer
14 years 1 months ago
A Phase Transition-Based Perspective on Multiple Instance Kernels
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
Romaric Gaudel, Michèle Sebag, Antoine Corn...