3470 search results - page 437 / 694 » Head-Elementary-Set-Free Logic Programs |
157
click to vote
MST
2007
15 years 6 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
154
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
177
click to vote
ICTAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
222
click to vote
ICTAI
2007
IEEE
16 years 29 days ago
2007
IEEE
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
193
click to vote
ISSTA
2004
ACM
16 years 2 days ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...