Sciweavers

ICAIL
2011
ACM
12 years 11 months ago
On the relationship between Carneades and Defeasible Logic
We study the formal relationships between the inferential aspects of Carneades (a general argumentation framework) and Defeasible Logic. The outcome of the investigation is that t...
Guido Governatori
IAAI
2011
12 years 11 months ago
Online Planning to Control a Packaging Infeed System
After successfully developing a model-based online planner for the multi-engine hyper-modular prototype printer at PARC, we began investigating other applications with similar cha...
Minh Binh Do, Lawrence Lee, Rong Zhou, Lara S. Cra...
IAAI
2011
12 years 11 months ago
NewsFinder: Automating an Artificial Intelligence News Service
NewsFinder automates the steps involved in finding, selecting and publishing news stories that meet subjective judgments of relevance and interest to the Artificial Intelligence c...
Liang Dong, Reid G. Smith, Bruce G. Buchanan

0
posts
with
0
views
118profile views
voidmousStudent, Msc
voidmous
EPIA
2011
Springer
12 years 11 months ago
Thematic Fuzzy Clusters with an Additive Spectral Approach
This paper introduces an additive fuzzy clustering model for similarity data as oriented towards representation and visualization of activities of research organizations in a hiera...
Susana Nascimento, Rui Felizardo, Boris Mirkin
CP
2011
Springer
12 years 11 months ago
Skill-based differences in option generation in a complex task: a verbal protocol analysis
In recent models of decision-making, cognitive scientists have examined the relationship between option generation and successful performance. These models suggest that those who a...
Paul Ward, Joel Suss, David W. Eccles, A. Mark Wil...
CP
2011
Springer
12 years 11 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
CP
2011
Springer
12 years 11 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
CP
2011
Springer
12 years 11 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...