Sciweavers

3572 search results - page 94 / 715
» Nominal Logic Programming
Sort
View
AAAI
1990
15 years 1 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
ESOP
2009
Springer
15 years 7 months ago
Automatic Parallelization with Separation Logic
Abstract. We present a separation logic framework which can express properties of memory separation between different points in a program. We describe an algorithm based on this fr...
Mohammad Raza, Cristiano Calcagno, Philippa Gardne...
110
Voted
ICFP
2005
ACM
16 years 17 days ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
LPNMR
2009
Springer
15 years 7 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
59
Voted
ICLP
2007
Springer
15 years 6 months ago
Ontology Based Information Integration Using Logic Programming
Gergely Lukácsy, Péter Szeredi