Sciweavers

1941 search results - page 138 / 389
» On the Hardness of Approximate Reasoning
Sort
View
JOLLI
2006
123views more  JOLLI 2006»
15 years 6 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
COR
2008
131views more  COR 2008»
15 years 6 months ago
Comparing methods for multiattribute decision making with ordinal weights
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
Byeong Seok Ahn, Kyung Sam Park
KR
2010
Springer
15 years 11 months ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
ESWS
2006
Springer
15 years 10 months ago
Encoding Classifications into Lightweight Ontologies
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
Fausto Giunchiglia, Maurizio Marchese, Ilya Zaihra...
EWCBR
2008
Springer
15 years 8 months ago
Evaluation Measures for TCBR Systems
Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are neede...
M. A. Raghunandan, Nirmalie Wiratunga, Sutanu Chak...