147
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we propose a new agent communication language which separates agent dialogue from any specific agent reasoning technology. This language is intended to address a nu...
121
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
139
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
150
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
144
click to vote
AMAI
2004
Springer
15 years 10 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...
135
Voted
AMAI
2004
Springer
15 years 10 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
15 years 10 months ago
2004
Springer
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
115
Voted
AMAI
2004
Springer
15 years 10 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...