Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
In this paper, after a new DNA-based semantic model is theoretically proposed, the preliminary experiment on construction of the small test model is successfully done. This model, ...