5109 search results - page 298 / 1022 » On Learning Limiting Programs |
308
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
198
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
179
click to vote
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
190
click to vote
SAC
2005
ACM
16 years 8 days ago
2005
ACM
More and more software projects are using COTS (Commercialoff-the-shelf) components. Using COTS components brings both advantages and risks. To manage some risks in using COTS com...
200
click to vote
NMR
2004
Springer
16 years 2 days ago
2004
Springer
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...