348 search results - page 52 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
127
click to vote
ILP
2005
Springer
15 years 7 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
128
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
135
click to vote
CSFW
2011
IEEE
14 years 2 months ago
2011
IEEE
—This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by ...
158
click to vote
SCP
1998
15 years 1 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
125
click to vote
ICLP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...