1650 search results - page 146 / 330 » The HOM problem is decidable |
135
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
135
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
108
click to vote
TPHOL
2003
IEEE
15 years 9 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
143
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
136
click to vote
EGOV
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. As the e-government domain is about to become a field of application for Semantic Web technologies, the actors involved still lack reasoning to decide on critical issues ...