8 search results - page 2 / 2 » Nonmonotonic Reasoning is Sometimes Simpler |
KI
1990
Springer
13 years 9 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
ALP
1994
Springer
13 years 9 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
AI
2007
Springer
13 years 5 months ago
2007
Springer
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...