aboutsummaryrefslogtreecommitdiff
path: root/math/clasp/pkg-descr
diff options
context:
space:
mode:
authorVsevolod Stakhov <vsevolod@FreeBSD.org>2013-09-19 14:14:54 +0000
committerVsevolod Stakhov <vsevolod@FreeBSD.org>2013-09-19 14:14:54 +0000
commitfc0535e09b6c3d4f06c79d509d38c6a3ca7b88cb (patch)
tree795f28852bf105e53d8a976b554de0636a52db05 /math/clasp/pkg-descr
parent9bf84429029ea6f313ca1004327395b46368be2b (diff)
downloadports-fc0535e09b6c3d4f06c79d509d38c6a3ca7b88cb.tar.gz
ports-fc0535e09b6c3d4f06c79d509d38c6a3ca7b88cb.zip
Notes
Diffstat (limited to 'math/clasp/pkg-descr')
-rw-r--r--math/clasp/pkg-descr13
1 files changed, 13 insertions, 0 deletions
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/