131 search results - page 18 / 27 » Complexity of the Satisfiability Problem for a Class of Prop... |
ASP
2003
Springer
14 years 23 days ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
SIAMCOMP
2002
13 years 7 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...