by Włodzimierz Drabent, Institute of Computer Science, Polish Academy of Sciences, and IDA, Linköpings universitet, Sweden.
Category: ALP ISSUE
Finite Domain Constraints in SICStus Prolog
By Mats Carlsson, SICS
BPSolver’s Solutions to the Third ASP Competition Problems
By Neng-Fa Zhou, Agostino Dovier, and Yuanlin Zhang
ICLP 2011: Accepted papers
Accepted papers of ICLP2011, 27th International Conference on Logic Programming, Lexington, KY, USA, July 6-10, 2011.
International Spring School on Computational Logic
by Polina Kuznetsova
SUNY Stony Brook,
USA
Editorial, March 2011
Dear LPers, as we all know this is a scientific newsletter that tries to keep real-world problem outside as much as possible. But we believe that this cannot be the case this time and we’ll spend a couple of words…
Natural Language Processing With Prolog in the IBM Watson System
By Adam Lally, IBM Thomas J. Watson Research Center, and Paul Fodor, Stony Brook University
A Pearl on SAT Solving in Prolog (extended abstract)
By Jacob M. Howe, Department of Computing, City University London, and Andy King, School of Computing, University of Kent, Canterbury.
Concurrent Programming Constructs and First-Class Logic Engines
By Paul Tarau, Department of Computer Science and Engineering, University of North Texas, Denton, Texas.
LPNMR 2011: Accepted papers
Accepted papers of LPNMR 2011,
11th International Conference on Logic Programming and Nonmonotonic Reasoning,
Vancouver, May 16-19, 2011