Sciweavers

1802 search results - page 153 / 361
» Model-based Theory Combination
Sort
View
IJAR
2008
129views more  IJAR 2008»
13 years 9 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
IPL
2006
118views more  IPL 2006»
13 years 9 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
AUTOMATICA
2005
60views more  AUTOMATICA 2005»
13 years 9 months ago
Robust output regulation with nonlinear exosystems
For over a decade, the solvability of the nonlinear robust output regulation problem relies on the assumption that the exosystem is linear and neurally stable. Thus the only exogen...
Zhiyong Chen, Jie Huang
TROB
2008
210views more  TROB 2008»
13 years 9 months ago
Dynamical System Modulation for Robot Learning via Kinesthetic Demonstrations
We present a system for robust robot skill acquisition from kinesthetic demonstrations. This system allows a robot to learn a simple goal-directed gesture, and correctly reproduce...
Micha Hersch, Florent Guenter, Sylvain Calinon, Au...
ENTCS
2002
129views more  ENTCS 2002»
13 years 9 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi