3552 search results - page 385 / 711 » Proof theory in the abstract |
178
click to vote
DAM
2008
15 years 6 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
188
click to vote
ECCC
2008
15 years 6 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
207
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
213
click to vote
PR
2008
15 years 6 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
176
click to vote
IJAR
2007
15 years 6 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...