Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
This paper provides guidance for operating an assemble-to-order system to maximize expected discounted profit, assuming that a high volume of prospective customers arrive per unit...