The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

06/05/2009
by   P. Mancarella, et al.
0

We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state of the art abductive systems and answer set solvers and showing how to use it to program some applications. (To appear in Theory and Practice of Logic Programming - TPLP).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2019

SMT-based Constraint Answer Set Solver EZSMT+

Constraint answer set programming integrates answer set programming with...
research
10/20/1998

A Proof Theoretic View of Constraint Programming

We provide here a proof theoretic account of constraint programming that...
research
07/03/2000

Constraint Exploration and Envelope of Simulation Trajectories

The implicit theory that a simulation represents is precisely not in the...
research
10/10/2018

Trapezoidal Generalization over Linear Constraints

We are developing a model-based fuzzing framework that employs mathemati...
research
09/15/2018

Description, Implementation, and Evaluation of a Generic Design for Tabled CLP

Logic programming with tabling and constraints (TCLP, tabled constraint ...
research
08/24/2018

Reference Type Logic Variables in Constraint-logic Object-oriented Programming

Constraint-logic object-oriented programming, for example using Muli, fa...
research
06/12/2018

Augmenting Stream Constraint Programming with Eventuality Conditions

Stream constraint programming is a recent addition to the family of cons...

Please sign up or login with your details

Forgot password? Click here to reset