387 search results - page 22 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
FOSSACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
ENTCS
2002
13 years 7 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...