2911 search results - page 135 / 583 » A Logic of Graph Constraints |
83
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
91
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
178
Voted
BVAI
2007
Springer
15 years 6 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
90
Voted
CP
2003
Springer
15 years 6 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
92
Voted
GECCO
2000
Springer
15 years 4 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...