Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
We report on work in progress on extracting lexical simplifications (e.g., "collaborate" "work together"), focusing on utilizing edit histories in Simple Engli...
Mark Yatskar, Bo Pang, Cristian Danescu-Niculescu-...
We examine parallel algorithms for molecular dynamics simulations involving long-range induction interactions. The algorithms are tested by performing molecular dynamics simulatio...