Sciweavers

5630 search results - page 122 / 1126
» Computability in Specification
Sort
View
DALT
2009
Springer
15 years 7 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
EWCBR
2008
Springer
15 years 6 months ago
Realising a CBR-based approach for Computer Cooking Contest with e: IAS
Abstract. This paper describes a web-based CBR application competing at the first Computer Cooking Contest at the ECCBR 2008. It describes the technical realisation of our system, ...
Alexandre Hanft, Norman Ihle, Kerstin Bach, R&eacu...
149
Voted
AGI
2008
15 years 5 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
132
Voted
ACL
2006
15 years 5 months ago
Modeling Adjectives in Computational Relational Lexica
In this paper we propose a small set of lexical conceptual relations which allow to encode adjectives in computational relational lexica in a principled and integrated way. Our ma...
Palmira Marrafa, Sara Mendes
JAIR
2008
173views more  JAIR 2008»
15 years 4 months ago
Computational Logic Foundations of KGP Agents
This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous...
Antonis C. Kakas, Paolo Mancarella, Fariba Sadri, ...