Sciweavers

578 search results - page 88 / 116
» A Logic Programming Based Approach to QA@CLEF05 Track
Sort
View
PLILP
1993
Springer
15 years 1 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
PLDI
2009
ACM
15 years 10 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
AMAST
2008
Springer
14 years 11 months ago
Explaining Verification Conditions
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
Ewen Denney, Bernd Fischer 0002
ICML
2009
IEEE
15 years 10 months ago
Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...
Filip Zelezný, Ondrej Kuzelka
FLOPS
1999
Springer
15 years 1 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach