700 search results - page 27 / 140 » On Termination of Constraint Logic Programs |
224
click to vote
IFIP
2001
Springer
15 years 11 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
180
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
197
click to vote
ENTCS
2007
15 years 6 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
176
click to vote
LPNMR
2004
Springer
15 years 12 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
162
click to vote
ICWL
2007
Springer
16 years 21 days ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...