https://github.com/aig-hagen/algorithms_for_acceptable_arguments

https://github.com/aig-hagen/algorithms_for_acceptable_arguments

Last synced: about 2 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/aig-hagen/algorithms_for_acceptable_arguments
• Owner: aig-hagen
• Created: 2024-03-13T14:13:15.000Z (10 months ago)
• Default Branch: main
• Last Pushed: 2024-08-12T07:24:23.000Z (5 months ago)
• Last Synced: 2024-08-12T08:44:59.708Z (5 months ago)
• Language: C++
• Size: 7.78 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# algorithms_for_acceptable_arguments v1.0 (03-2024)

Implements several SAT-based algorithms for enumerating credulously/skeptically accepted arguments for abstract argumentation frameworks.

Supports the following problems: [`EC-CO`,`EC-PR`,`EC-ST`,`ES-PR`,`ES-ST`]

Supports TGF and i23 format for abstract argumentation frameworks.

## Installation

### Building SAT Solvers

This solver supports multiple integrated SAT Solvers, namely [CaDiCal](https://github.com/arminbiere/cadical) (version 1.9.5), [Glucose](https://github.com/audemard/glucose) (version 4.1) and [CryptoMiniSat](https://github.com/msoos/cryptominisat) (version 5.11.21).

For the SEEM approach an integrated MaxSAT Solver [CGSS2](https://bitbucket.org/coreo-group/cgss2/src/master/).

The relevant source files are included and the solvers can easily be built as follows

#### CaDiCal

```

  make cadical

```

#### Glucose

To use Glucose `g++-11` needs to be installed

```

  make glucose

```

### CryptoMiniSat

CryptoMiniSat requires `cmake`

```

  sudo apt-get install build-essential cmake

```

Install Boost libraries and other prerequisites

```

sudo apt-get install zlib1g-dev libboost-program-options-dev libsqlite3-dev

```

Building and installing CryptoMiniSat

```

  make cmsat

```

### CGSS2

Install prerequisites

```

  apt-get install libgmp3-dev

  apt-get install libboost-iostreams-dev

```

Building CGSS2

```

  make cgss2

```

## Compile and Build Solver

To compile and build all possible combinations of solvers and algorithms use

```

  make full

```

To compile and build solver for all algorithms use

```

    make all

```

Alternatively, build only for a specific algorithm via

```

    make 

```

or 

```

    make ALGORITHM=

```

The SAT solver to be used can be specified as follows

```

  make  SOLVER=

```

### Example

To build only the solver based on the IAQ algorithm using the CaDiCal SAT Solver

```

  make iaq SOLVER=cadical

```

Or, to build the solver for all algorithms using Glucose

```

  make all SOLVER=glucose

```

## Command-line usage

```

./solver.sh  -p  -f  -fo 

  

   the algorithm for computation, one of: [iaq,eee,see,seem,fudge]

        computational problem

        input argumentation framework

      file format for input AF

Options:

  --help      Displays this help message.

  --version   Prints version and author information.

  --formats   Prints available file formats.

  --problems  Prints available computational problems.

```

Example usage:

```

  ./solver.sh iaq -p EC-PR -fo tgf -f 

```

Alternatively, you can also directly call the binary for each algorithm, e.g.

```

  ./build/bin//solver -p EC-PR -fo tgf -f 

```