1

Multiple-origin-multiple-destination path finding with minimal arc usage: Complexity and models

Optimization of a compiler from PDDL to Picat (Short Paper)

Picat is a new constraint logic programming language that has obtained promising results in international competitions. These re-sults have been achieved thanks to several features. The most effective of them is an efficient handling of a tabling …

Towards a Logic Programming Tool for Cancer Analysis

A GPU implementation of the ASP computation

General Purpose Graphical Processing Units (GPUs) are affordable multi-core platforms, providing access to large number of cores, but at the price of a complex architecture with non-trivial synchronization and communication costs. This paper presents …

Compiling and executing PDDL in picat

Computing LZ77 in Run-Compressed Space

In this paper, we show that the LZ77 factorization of a text T ∈ Σn can be computed in O(R log n) bits of working space and O(n log R) time, R being the number of runs in the Burrows-Wheeler transform of T (reversed). For (extremely) repetitive …

Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems

Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais, Edalat, and …

Exploring the use of BDDs in conformant planning

This paper explores the use of Binary Decision Diagrams (BDDs) in Conformant Planning. A conformant planner, called BPA, based on the BDD representation for belief sets is developed. Heuristics that fit with the BDD representation are presented and …

Labelled variables in logic programming: Foundations

Logic programming applied to genome evolution in cancer?