SPARC - Sorted ASP with Consistency Restoring Rules

01/08/2013
by   Evgenii Balai, et al.
0

This is a preliminary report on the work aimed at making CR-Prolog -- a version of ASP with consistency restoring rules -- more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The results form the foundation for future more efficient and user friendly implementation of SPARC and shed some light on the relationship between two useful knowledge representation constructs: consistency restoring rules and weak constraints of DLV.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2014

Preliminary Report on WASP 2.0

Answer Set Programming (ASP) is a declarative programming paradigm. The ...
research
09/22/2020

A System for Explainable Answer Set Programming

We present xclingo, a tool for generating explanations from ASP programs...
research
09/07/2021

Aspartix-V21

In this solver description we present ASPARTIX-V, in its 2021 edition, w...
research
01/08/2013

Language ASPf with Arithmetic Expressions and Consistency-Restoring Rules

In this paper we continue the work on our extension of Answer Set Progra...
research
05/05/2014

The Multi-engine ASP Solver ME-ASP: Progress Report

MEASP is a multi-engine solver for ground ASP programs. It exploits algo...
research
10/21/2012

Typed Answer Set Programming and Inverse Lambda Algorithms

Our broader goal is to automatically translate English sentences into fo...
research
10/11/2012

Multi-threaded ASP Solving with clasp

We present the new multi-threaded version of the state-of-the-art answer...

Please sign up or login with your details

Forgot password? Click here to reset