275 search results - page 34 / 55 » Non-Termination Inference of Logic Programs |
CSL
1995
Springer
15 years 1 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ML
2006
ACM
14 years 9 months ago
2006
ACM
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
108
click to vote
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...