Sciweavers

2084 search results - page 278 / 417
» Set Constraints in Logic Programming
Sort
View
LPNMR
1993
Springer
14 years 10 days ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
ESOP
2006
Springer
13 years 12 months ago
Inference of User-Defined Type Qualifiers and Qualifier Rules
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...
COR
2007
106views more  COR 2007»
13 years 7 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
CPAIOR
2005
Springer
14 years 1 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
COR
2010
105views more  COR 2010»
13 years 8 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...