AMAI
2004
Springer
14 years 6 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the probability of misclassification of future data points based on reliable ...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
AMAI
2004
Springer
14 years 6 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...