1650 search results - page 192 / 330 » The HOM problem is decidable |
146
Voted
AI
2008
Springer
15 years 4 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
128
Voted
IGPL
2008
15 years 4 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
135
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
154
Voted
TCS
2010
15 years 3 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...