cb456c0390
"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 <flangy@gmail.com>
12 lines
298 B
Ruby
12 lines
298 B
Ruby
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
|