729 search results - page 20 / 146 » Solving subgraph isomorphism problems with constraint progra... |
SAS
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
ICTAI
2008
IEEE
15 years 3 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
70
Voted
CAV
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
158
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...