ACSolver is a system, to compute answer sets for AC(R) Programs.
Language AC(R) extends CR-Prolog by classifying predicates to different types.
This allows use of different reasoning mechanisms to different parts of the
program and efficient computation of answer sets.
Classical Answer Set Programming (ASP) solvers use Davis-Putnam type
of reasoning mechanisms to compute answer sets of A-Prolog programs.
ACSolver integrates (1) Davis-Putnam type of algorithm for computing
answer sets of ASP programs, (2) a form of abduction from CR-Prolog,
(3) constraint satisfaction from CLP and (4) resolution mechanisms
from CLP.
Please use the examples below to refer to the syntax used by the solver.
A formal manual for the use of the solver will be available soon.
All papers and thesis reports are available from the
KR-LAB website.
|