6554 search results - page 341 / 1311 » Constraint Logic Programming |
185
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
194
click to vote
DLOG
2003
15 years 8 months ago
2003
In this paper, we investigate the use of Description Logic (DL) for representing Product Behavioral constraints in Computer Aided Design (CAD) Systems. In an integrated design app...
249
click to vote
Book
"This book on applications of logic in the semantic analysis of language pays the
reader the compliment of not assuming anything about what he or she knows (in particular, no...
173
click to vote
EUROGP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
189
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...