aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorvsevolod <vsevolod@FreeBSD.org>2013-09-19 22:14:54 +0800
committervsevolod <vsevolod@FreeBSD.org>2013-09-19 22:14:54 +0800
commit27938bcc064a230813942970009eed0d9721c7f5 (patch)
tree795f28852bf105e53d8a976b554de0636a52db05
parente3f5e38b7f59de2a98e716cc264462f7ce6161bb (diff)
downloadfreebsd-ports-gnome-27938bcc064a230813942970009eed0d9721c7f5.tar.gz
freebsd-ports-gnome-27938bcc064a230813942970009eed0d9721c7f5.tar.zst
freebsd-ports-gnome-27938bcc064a230813942970009eed0d9721c7f5.zip
Add clasp - an answer set solver for (extended) normal logic programs.
-rw-r--r--math/clasp/Makefile21
-rw-r--r--math/clasp/distinfo2
-rw-r--r--math/clasp/pkg-descr13
3 files changed, 36 insertions, 0 deletions
diff --git a/math/clasp/Makefile b/math/clasp/Makefile
new file mode 100644
index 000000000000..16fd9f6b21b7
--- /dev/null
+++ b/math/clasp/Makefile
@@ -0,0 +1,21 @@
+# Created by: Vsevolod Stakhov <vsevolod@FreeBSD.org>
+# $FreeBSD$
+
+PORTNAME= clasp
+PORTVERSION= 2.1.3
+CATEGORIES= math devel
+MASTER_SITES= ${MASTER_SITE_SOURCEFORGE}
+MASTER_SITE_SUBDIR= potassco/${PORTNAME}/${PORTVERSION}
+EXTRACT_SUFX= -source.tar.gz
+
+MAINTAINER= vsevolod@FreeBSD.org
+COMMENT= Answer set solver for (extended) normal logic programs
+
+USES= cmake:outsource
+
+PLIST_FILES= bin/${PORTNAME}
+
+do-install:
+ ${INSTALL} ${INSTALL_WRKSRC}/bin/${PORTNAME} ${PREFIX}/bin/${PORTNAME}
+
+.include <bsd.port.mk>
diff --git a/math/clasp/distinfo b/math/clasp/distinfo
new file mode 100644
index 000000000000..ada1b32276f0
--- /dev/null
+++ b/math/clasp/distinfo
@@ -0,0 +1,2 @@
+SHA256 (clasp-2.1.3-source.tar.gz) = 84b737845482b91f8ccb6eab6784c7641bb6986ce725194d3f74ddaf832ebfc7
+SIZE (clasp-2.1.3-source.tar.gz) = 397519
diff --git a/math/clasp/pkg-descr b/math/clasp/pkg-descr
new file mode 100644
index 000000000000..d1cce4a0d927
--- /dev/null
+++ b/math/clasp/pkg-descr
@@ -0,0 +1,13 @@
+Clasp is an answer set solver for (extended) normal logic programs. It combines
+the high-level modeling capacities of answer set programming (ASP) with
+state-of-the-art techniques from the area of Boolean constraint solving. The
+primary clasp algorithm relies on conflict-driven nogood learning, a technique
+that proved very successful for satisfiability checking (SAT). Unlike other
+learning ASP solvers, clasp does not rely on legacy software, such as a SAT
+solver or any other existing ASP solver. Rather, clasp has been genuinely
+developed for answer set solving based on conflict-driven nogood learning.
+clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo),
+as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB
+solver (on OPB format).
+
+WWW: http://potassco.sourceforge.net/