Language ASPf with Arithmetic Expressions and Consistency-Restoring Rules

01/08/2013
by   Marcello Balduccini, et al.
0

In this paper we continue the work on our extension of Answer Set Programming by non-Herbrand functions and add to the language support for arithmetic expressions and various inequality relations over non-Herbrand functions, as well as consistency-restoring rules from CR-Prolog. We demonstrate the use of this latest version of the language in the representation of important kinds of knowledge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2003

Using Propagation for Solving Complex Arithmetic Constraints

Solving a system of nonlinear inequalities is an important problem for w...
research
08/06/2021

Here and There with Arithmetic

In the theory of answer set programming, two groups of rules are called ...
research
06/08/2017

Regular Boardgames

We present an initial version of Regular Boardgames general game descrip...
research
01/08/2013

SPARC - Sorted ASP with Consistency Restoring Rules

This is a preliminary report on the work aimed at making CR-Prolog -- a ...
research
02/10/2022

Complexity of Arithmetic in Warded Datalog+-

Warded Datalog+- extends the logic-based language Datalog with existenti...
research
06/08/2016

Simplified Boardgames

We formalize Simplified Boardgames language, which describes a subclass ...
research
10/20/2020

Evaluation of Logic Programs with Built-Ins and Aggregation: A Calculus for Bag Relations

We present a scheme for translating logic programs, which may use aggreg...

Please sign up or login with your details

Forgot password? Click here to reset