6167 search results - page 940 / 1234 » Can Refinement be Automated |
218
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
143
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
120
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
137
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
152
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
There is extensive interest in automating the collection, organization and summarization of biological data. Data in the form of figures and accompanying captions in literature pr...