3446 search results - page 215 / 690 » A Reasoning Algorithm for pD* |
149
click to vote
ILP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
135
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
114
click to vote
ICLP
1994
Springer
15 years 8 months ago
1994
Springer
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
123
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
114
click to vote
CTRSA
2009
Springer
15 years 8 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...