Sciweavers

517 search results - page 42 / 104
» Using dynamic logic programming to model legal reasoning
Sort
View
COLT
1994
Springer
14 years 3 days ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ICLP
2007
Springer
14 years 2 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
CSL
2006
Springer
13 years 11 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
SIGSOFT
2002
ACM
14 years 8 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...