Deriving sorting algorithms via abductive logic program transformation

10/04/2018
by   Manuel Hernández, et al.
0

Logic program transformation by the unfold/fold method ad- vocates the writing of correct logic programs via the application of some rules to a naive program. This work focuses on how to overcome subgoal- introduction difficulties in synthesizing efficient sorting algorithms from an naive sorting algorithm, through logic program transformation and abductive reasoning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2022

A Formalisation of Algorithms for Sorting Network

This notes explains how standard algorithms that construct sorting netwo...
research
10/03/2021

Is this the simplest (and most surprising) sorting algorithm ever?

We present an extremely simple sorting algorithm. It may look like it is...
research
07/29/2022

Informal proceedings of the 32nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2022)

This volume constitutes the informal proceedings of the 32nd Internation...
research
08/07/2020

Transformational Verification of Quicksort

Many transformation techniques developed for constraint logic programs, ...
research
07/07/2020

Strong Generalization and Efficiency in Neural Programs

We study the problem of learning efficient algorithms that strongly gene...
research
11/23/2020

Searching and Sorting with O(n^2) processors in O(1) time

The proliferation of number of processing elements (PEs) in parallel com...
research
12/17/2020

Sorting in Memristive Memory

Sorting is needed in many application domains. The data is read from mem...

Please sign up or login with your details

Forgot password? Click here to reset