From 83efb8ad1e19ea06194cec6730d40d8aaf15b82a Mon Sep 17 00:00:00 2001 From: Libor Wagner Date: Wed, 12 Oct 2011 14:37:49 +0200 Subject: blackbox 44 "Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a variety of state-of-the-art satisfiability engines. The front-end employs the graphplan system (Blum and Furst 1995). There is extreme flexibility in specifying the engines to use. For example, you can tell it to use walksat (Selman, Kautz, and Cohen 1994) for 60 seconds, and if that fails, then satz (Li and Anbulagan 1997) for 1000 seconds. This gives blackbox the capability of functioning efficiently over a broad range of problems. The name blackbox refers to the fact that the plan generator knows nothing about the SAT solvers, and the SAT solvers know nothing about plans: each is a "black box" to the other." [http://www.cs.rochester.edu/u/kautz/satplan/blackbox/] Signed-off-by: Adam Vandenberg --- Library/Formula/blackbox.rb | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Library/Formula/blackbox.rb (limited to 'Library/Formula') diff --git a/Library/Formula/blackbox.rb b/Library/Formula/blackbox.rb new file mode 100644 index 000000000..789650a2e --- /dev/null +++ b/Library/Formula/blackbox.rb @@ -0,0 +1,12 @@ +require 'formula' + +class Blackbox < Formula + homepage 'http://www.cs.rochester.edu/u/kautz/satplan/blackbox/' + url 'http://www.cs.rochester.edu/u/kautz/satplan/blackbox/Blackbox44.tgz' + md5 'b11aca3c49eb63b2b914b689c2a89dec' + + def install + system "make" + bin.install 'blackbox' + end +end -- cgit v1.2.3