Sciweavers

1187 search results - page 41 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
AUSAI
2007
Springer
14 years 2 months ago
Temporal Extensions to Defeasible Logic
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...
Guido Governatori, Paolo Terenziani
HPDC
1997
IEEE
14 years 21 days ago
PARDIS: A Parallel Approach to CORBA
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...
Katarzyna Keahey, Dennis Gannon
FSTTCS
2008
Springer
13 years 9 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
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...
Takahito Aoto
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian framework for optimal motion planning with uncertainty
— 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...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
ICML
1989
IEEE
14 years 16 days ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
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...
Scott Dietzen, Frank Pfenning