The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Abstract. This paper is concerned with the question of quantifying gradient degrees of acceptability by introducing the notion of Density in the context of constructional constrain...
Abstract. A concept of annotations for rendering procedural aspects of Prolog is presented, built around wellknown procedural concepts of Standard Prolog. Annotations describe prop...
Abstract. This paper presents a framework that lets a component developer provide a component user with different kinds of information, depending on the specific context and needs....
Alessandro Orso, Mary Jean Harrold, David S. Rosen...
Abstract. Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is ...
John N. Zigman, Stephen Blackburn, J. Eliot B. Mos...