973 search results - page 105 / 195 » Arguing Using Opponent Models |
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
Williamson (2000a) has argued that positive introspection is incompatible with inexact knowledge. His argument relies on a margin-for-error requirement for inexact knowledge based...
IATA
1998
Springer
13 years 12 months ago
1998
Springer
In this paper, we present several approaches to making the process of configuring network devices easier than is currently the case. Configuring a device requires that a number of ...
AI
2007
Springer
14 years 1 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘or...
IAT
2005
IEEE
14 years 1 months ago
2005
IEEE
The BDI agent model comprises a simple but efficient folk psychological framework of mentalistic notions usable for modeling rational agent behaviour. Nevertheless, despite its u...