Sciweavers

1941 search results - page 165 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ICCS
2007
Springer
16 years 20 days ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
ICLP
2007
Springer
16 years 20 days ago
Core TuLiP Logic Programming for Trust Management
We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM ...
Marcin Czenko, Sandro Etalle
ICSOC
2007
Springer
16 years 20 days ago
Mobile Ontology: Towards a Standardized Semantic Model for the Mobile Domain
Ontologies will be crucial for the future development of Next Generation Service Delivery Platforms. While various projects have defined ontologies for the mobile domain, there is ...
Claudia Villalonga, Martin Strohbach, Niels Snoeck...
LPNMR
2007
Springer
16 years 20 days ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
IJCNN
2006
IEEE
16 years 16 days ago
Recognizing Human Emotion from Partial Facial Features
—Recognizing human emotions from partial facial features is quite hard to achieve reasonable accuracy. In this paper, we propose to use a tree structure representation to simulat...
Jia-Jun Wong, Siu-Yeung Cho