1187 search results - page 41 / 238 » Computation in Extended Argumentation Frameworks |
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with...
103
click to vote
HPDC
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper describes PARDIS, a system containing explicit support for interoperability of PARallel DIStributed applications. PARDIS is based on the Common Object Request Broker Ar...
116
click to vote
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
105
click to vote
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
123
click to vote
ICML
1989
IEEE
15 years 5 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...