764 search results - page 63 / 153 » On the Expressibility of Stable Logic Programming |
144
Voted
ECOOP
2010
Springer
15 years 7 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
151
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
132
Voted
POS
1998
Springer
15 years 7 months ago
1998
Springer
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
104
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
148
Voted
JAR
2007
15 years 3 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...