6554 search results - page 124 / 1311 » Constraint Logic Programming |
152
click to vote
VL
2003
IEEE
15 years 11 months ago
2003
IEEE
At the beginning stage of programming education, comprehending program logics plays a more important role than capturing knowledge of a specific program language. In this paper, t...
148
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
149
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
169
click to vote
AAAI
1994
15 years 7 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
187
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...