Sciweavers

64 search results - page 12 / 13
» Normal Forms for Inductive Logic Programming
Sort
View
POPL
2012
ACM
12 years 3 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
ILP
2007
Springer
14 years 2 months ago
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
Ganesh Ramakrishnan, Sachindra Joshi, Sreeram Bala...
VMCAI
2004
Springer
14 years 1 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
ENTCS
2008
106views more  ENTCS 2008»
13 years 8 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...