903 search results - page 118 / 181 » Completeness Results for Memory Logics |
AAAI
1996
13 years 10 months ago
1996
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
EJC
2008
13 years 9 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
IRI
2007
IEEE
14 years 3 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
EH
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...