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 ...
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Thispaperdescribesthe applicationof the Inductive Logic Programming0LP) program GOLEMto the discoveryof constraintsin the packingof beta-sheets in alpha/betaproteins. Theseconstra...
Ross D. King, Dominic A. Clark, Jack Shirazi, Mich...
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...