1753 search results - page 91 / 351 » Reducibility of domain representations and Cantor-Weihrauch ... |
LPNMR
2007
Springer
14 years 3 months ago
2007
Springer
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic ...
AI
2001
Springer
14 years 1 months ago
2001
Springer
The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue...
ACL
2009
13 years 6 months ago
2009
A central problem in grounded language acquisition is learning the correspondences between a rich world state and a stream of text which references that world state. To deal with ...
ACL
2012
11 years 11 months ago
2012
“Lightweight” semantic annotation of text calls for a simple representation, ideally without requiring a semantic lexicon to achieve good coverage in the language and domain. ...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...