1650 search results - page 190 / 330 » The HOM problem is decidable |
146
click to vote
ECCC
2007
15 years 4 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
136
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
133
click to vote
ISCI
2007
15 years 4 months ago
2007
A Project Scheduling Problem consists in deciding who does what during the software project lifetime. This is a capital issue in the practice of software engineering, since the to...
121
click to vote
FUIN
2010
15 years 3 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
133
click to vote
PVLDB
2010
15 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...