213 search results - page 17 / 43 » Logic programs with annotated disjunctions |
ILP
2007
Springer
14 years 2 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
VL
2003
IEEE
14 years 1 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...
PTS
2010
13 years 5 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
ECOOP
2009
Springer
14 years 8 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
PEPM
2007
ACM
14 years 2 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...