1144 search results - page 79 / 229 » Logic programming for combinatorial problems |
112
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
125
Voted
AMAST
2008
Springer
15 years 4 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
153
click to vote
IPL
2006
15 years 2 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
110
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
119
click to vote
CONSTRAINTS
2006
15 years 2 months ago
2006
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs conta...