Sciweavers

AI
2002
Springer
13 years 7 months ago
Relaxed Unification - Proposal
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...
Tony Abou-Assaleh, Nick Cercone
AMAI
2004
Springer
13 years 7 months ago
Extending Answer Sets for Logic Programming Agents
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents...
Marina De Vos, Dirk Vermeir
AMAI
2004
Springer
13 years 7 months ago
Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming
Prototyping is a valuable technique to help software engineers explore the design space while gaining insight on the dynamics of the system. In this paper, we describe a method for...
Wamberto Weber Vasconcelos, David Stuart Robertson...
AMAI
2004
Springer
13 years 7 months ago
A Unifying Version-Space Representation
Evgueni N. Smirnov, H. Jaap van den Herik, Ida G. ...
AMAI
2004
Springer
13 years 7 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande
AMAI
2004
Springer
13 years 7 months ago
Satisfiability-Based Algorithms for Boolean Optimization
Vasco M. Manquinho, João P. Marques Silva
AMAI
2004
Springer
13 years 7 months ago
The Complexity of Symmetry-Breaking Formulas
Eugene M. Luks, Amitabha Roy
AMAI
2004
Springer
13 years 7 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang