Sciweavers

AMAI
2004
Springer
14 years 5 months ago
Multi-Agent Dialogue Protocols
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...
Christopher D. Walton
AMAI
2004
Springer
14 years 5 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
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...
Miroslav N. Velev
AMAI
2004
Springer
14 years 5 months ago
Warped Landscapes and Random Acts of SAT Solving
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...
Dave A. D. Tompkins, Holger H. Hoos
AMAI
2004
Springer
14 years 5 months ago
Improving Exact Algorithms for MAX-2-SAT
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...
Haiou Shen, Hantao Zhang
AMAI
2004
Springer
14 years 5 months ago
Deductive Algorithmic Knowledge
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...
Riccardo Pucella
AMAI
2004
Springer
14 years 5 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
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 ...
Justin Pearson
AMAI
2004
Springer
14 years 5 months ago
Analysis of Greedy Robot-Navigation Methods
Apurva Mudgal, Craig A. Tovey, Sven Koenig
AMAI
2004
Springer
14 years 5 months ago
Learning via Finitely Many Queries
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...
Andrew C. Lee