Sciweavers

543 search results - page 20 / 109
» Argumentation Using Temporal Knowledge
Sort
View
FOIKS
2008
Springer
13 years 9 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
AGI
2008
13 years 9 months ago
Transfer Learning and Intelligence: an Argument and Approach
In order to claim fully general intelligence in an autonomous agent, the ability to learn is one of the most central capabilities. Classical machine learning techniques have had ma...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
EUROCRYPT
2007
Springer
13 years 11 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
SIGLEX
1991
13 years 11 months ago
General Lexical Representation for an Effect Predicate
This paper argues that there is no reason to distinguish between lexical information and real-world information on the basis of the formalisms used; that both types of knowledge c...
Martha Stone Palmer
TKDE
2010
164views more  TKDE 2010»
13 years 6 months ago
Defeasible Contextual Reasoning with Arguments in Ambient Intelligence
Abstract—The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context informa...
Antonis Bikakis, Grigoris Antoniou