764 search results - page 49 / 153 » On the Expressibility of Stable Logic Programming |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
ENC
2005
IEEE
14 years 1 months ago
2005
IEEE
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...
PODS
1991
ACM
13 years 11 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...