277 search results - page 27 / 56 » Precise reasoning for programs using containers |
IJCAI
2007
13 years 10 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
This paper is about the fusion of multiple information sources represented using default logic. More precisely, the focus is on solving the problem that occurs when the standard-lo...
ICLP
2010
Springer
14 years 20 days 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...
CASCON
2003
13 years 10 months ago
2003
Any attempt at automated software analysis or modification must be preceded by a comprehension step, i.e. parsing. This task, while often considered straightforward, can in fact ...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...