1204 search results - page 140 / 241 » Termination of Polynomial Programs |
132
Voted
JAR
2007
15 years 18 days 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...
MP
1998
15 years 11 days 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...
112
Voted
LPAR
2010
Springer
14 years 10 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...
222
Voted
COSIT
2011
Springer
14 years 15 days 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...
CP
2004
Springer
15 years 6 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...