GitHub - MORZorg/SemOptRZ: Elaborato di Algoritmi e Strutture Dati

SemOpt: Computing argumentation semantics as optimisation problem

Licence

SemOpt: Computing argumentation semantics as optimisation problem

Copyleft 2013		Mattia Rizzini <m.rizzini006@studenti.unibs.it>
	     			Maurizio Zucchelli <m.zucchelli005@studenti.unibs.it>
	     			
Copyright (C) 2012-2013  	Federico Cerutti <f.cerutti@abdn.ac.uk>
			Mauro Vallati <m.vallati@hud.ac.uk>

Authors: Mattia Rizzini <m.rizzini006@studenti.unibs.it>
	     Maurizio Zucchelli <m.zucchelli005@studenti.unibs.it>
	     Federico Cerutti <f.cerutti@abdn.ac.uk>
     Mauro Vallati <m.vallati@hud.ac.uk>

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.

Description

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.

Quick Start

Compiling

For building the Release version:

Use make

Multiple test running and instances generation

See extensive latex documentation

Running

./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

Authors

Copyleft holders: Mattia Rizzini m.rizzini006@studenti.unibs.it, Maurizio Zucchelli m.zucchelli005@studenti.unibs.it, 2013

Copyright holder: Federico Cerutti PhD f.cerutti@abdn.ac.uk, (c) 2013