|
CloopDThe program cloopD is an implementation for computing some results that are in the intersection of all answer sets of a normal or disjunctive logic program. Specifically, cloopD returns literals that can be computed by an iterative procedure based on unit propagation from the program completion and the loop formulas of loops with at most one external support rule, i.e. the function T1(P) introduced in "Computing Loops With at Most One External Support Rule" (KR-08) and "Computing Loops With at Most One External Support Rule for Disjunctive Logic Programs" (ICLP-09). Note that, cloopD returns literals in the form of corresponding constraints.cloopD is implemented using C++ with STL by Jianmin Ji, and works under Linux system.
Download & installThis system is copyright by HKUST and is distributed freely for academic use at your own risk under the GNU Public Licence. You can download, unpack and compile it into binary file. The sample instructions for unpack and compile are as follows: % tar -xvf src_cloopD.tar % cd src_cloopD % make Now there will be the executable file "cloopD". UsageThe grounding system Lparse, gringo, or DLV( with a certain parameter ), is needed in your directory to execute cloopD. cloopD is typically invoked as follows: % lparse normal_program | cloopD % lparse --dlp disjunctive_program | cloopD % gringo normal_program | cloopD % gringo disjunctive_program | cloopD ( normal_program (disjunctive_program) is the name of the file containing a normal (disjunctive) logic program ).
Related PublicationsXiaoping Chen, Jianmin Ji, and Fangzhen Lin. Computing Loops With at Most One External Support Rule. In Proc. KR-2008.. Xiaoping Chen, Jianmin Ji, and Fangzhen Lin. Computing Loops With at Most One External Support Rule for Disjunctive Logic Programs. In Proc. ICLP-2009.. | ||||||