SemOpt: Computing argumentation semantics as optimisation problem
Copyleft 2013 Mattia Rizzini <[email protected]>
Maurizio Zucchelli <[email protected]>
Copyright (C) 2012-2013 Federico Cerutti <[email protected]>
Mauro Vallati <[email protected]>
Authors: Mattia Rizzini <[email protected]>
Maurizio Zucchelli <[email protected]>
Federico Cerutti <[email protected]>
Mauro Vallati <[email protected]>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Glucose and Precosat are distributed under their own Licence.
GTest is distributed under its own Licence.
ASPARTIX is distributed under its own Licence.
SemOpt uses SAT solvers and a bunch of other methods for computing the semantics extensions on a Dung's argumentation framework. Currently it works for preferred extensions only.
For building the Release version:
Use make
See extensive latex documentation
./SemOpt <inputfile.dl> ...
-d HIGH level of debug (very slow, very dense output)
-d2 LOWER level of debug, less dense and informative output
-ExtSAT uses as engine an external SAT Solver. Currently: GLUCOSE, PRECOSAT
-LabConds 0 (default) -> C_1
1 C_2
2 C_3
3 C_1^a
4 C_1^b
5 C_1^c
-sem Currently: complete, preferred, preferred-df, grounded, grounded-poly, stable, semistable
Copyleft holders: Mattia Rizzini [email protected], Maurizio Zucchelli [email protected], 2013
Copyright holder: Federico Cerutti PhD [email protected], (c) 2013