depqbf(1) [debian man page]

DEPQBF(1)						      General Commands Manual							 DEPQBF(1)

NAME

       depqbf - a solver for quantified boolean formulae

SYNOPSIS

       depqbf [options ...] [NUM] [FILE]

DESCRIPTION

       depqbf  is a search-based solver for quantified boolean formulae (QBF) in prenex conjunctive normal form. It is based on the DPLL algorithm
       for QBF with conflict-driven clause and solution-driven cube learning. By analyzing the structure of a formula, DepQBF  tries  to  identify
       independent  variables.	In addition to other benefits, this often increases freedom for decision making. See also the JSAT system descrip-
       tion of DepQBF 0.1 from QBFEVAL'10 for references and a brief outline of the idea.

       depqbf reads QBF formulas in QDIMACS format. If FILE is not given, it reads its input from stdin. It complies with  input/output  standards
       as required by QBFEVAL'10.

OPTIONS

       depqbf accepts the following options:

       -h, --help
	      Print usage information.

       --version
	      Print version.

       --pretty-print
	      Only parse and print formula.

       -v     Increase verbosity incrementally.

       NUM    Optional: time-out after NUM seconds.

       FILE   Optional: read input from FILE.

EXIT STATUS

       The  exit  status is 10 if the QBF formula given as input is satisfiable, and 20 if it is unsatisfiable; any other exit code indicates that
       the formula was not solved.

SEE ALSO

       picosat(1), minisat(1), clasp(1).

AUTHOR

       depqbf was written by Florian Lonsing <florian.lonsing@jku.at>.

       This manual page was written by Thomas Krennwallner <tkren@kr.tuwien.ac.at>,

								  August 26, 2011							 DEPQBF(1)

CLASP(1)						      General Commands Manual							  CLASP(1)

NAME

       clasp - a conflict-driven nogood learning answer set solver

SYNOPSIS

       clasp [number][options]

DESCRIPTION

       This manual page documents briefly the clasp command.

       clasp  is  an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set program-
       ming (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 LPARSE output format), as a SAT
       solver (on simplified DIMACS/CNF format), or as a PB solver (on OPB format).

OPTIONS

       These programs follow the usual GNU command line syntax, with long options starting with  two  dashes  (`-').   A  summary  of  options	is
       included below.	For a complete description, see <http://www.cs.uni-potsdam.de/clasp/>.

       -h, --help
	      Show summary of options.

       -v, --version
	      Show version of program.

SEE ALSO

       gringo(1).

AUTHOR

       clasp was written by Benjamin Kaufmann <kaufmann@cs.uni-potsdam.de>.

       This manual page was written by Thomas Krennwallner <tkren@kr.tuwien.ac.at>, for the Debian project (and may be used by others).

								  March  4, 2010							  CLASP(1)