4457 search results - page 619 / 892 » Tests of Machine Intelligence |
161
click to vote
AGP
1999
IEEE
15 years 9 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
134
click to vote
ATAL
1998
Springer
15 years 9 months ago
1998
Springer
In this paper, an agent architecture is proposed that can be used to integrate pre-existing components that provide the domain dependent agent functionality. The key integrating fe...
123
Voted
CP
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
164
click to vote
PRICAI
1998
Springer
15 years 9 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
161
click to vote
CP
1997
Springer
15 years 9 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...