1204 search results - page 140 / 241 » Termination of Polynomial Programs |
148
Voted
JAR
2007
15 years 3 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
119
Voted
MP
1998
15 years 3 months ago
1998
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
134
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
268
Voted
COSIT
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
122
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...