1650 search results - page 325 / 330 » The HOM problem is decidable |
IJCAI
2003
13 years 9 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
COLING
1992
13 years 8 months ago
1992
Q Should I take AI this semester? We address the problem of generating a coherent A If you want to take courses likeparagraph presenting arguments for a conclusion in a Natural La...
SPRINGSIM
2007
13 years 8 months ago
2007
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...