https://github.com/aig-hagen/serialisation-solver
Algorithms for computing serialisation sequences in argumentation frameworks
https://github.com/aig-hagen/serialisation-solver
argumentation argumentation-frameworks solver
Last synced: 11 months ago
JSON representation
Algorithms for computing serialisation sequences in argumentation frameworks
- Host: GitHub
- URL: https://github.com/aig-hagen/serialisation-solver
- Owner: aig-hagen
- License: gpl-3.0
- Created: 2024-08-26T17:29:44.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-11-29T11:26:19.000Z (over 1 year ago)
- Last Synced: 2025-01-12T20:30:24.002Z (over 1 year ago)
- Topics: argumentation, argumentation-frameworks, solver
- Language: C++
- Homepage:
- Size: 807 KB
- Stars: 0
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
[](https://opensource.org/license/gpl-3-0)
# serialisation-solver v1.2 (09-2024)
Implements algorithms for computing serialisation sequences for argumentation frameworks.
Supports i23 format for abstract argumentation frameworks.
## Installation
### Building SAT Solver
This solver works with [CaDiCal](https://github.com/arminbiere/cadical) (version 1.9.5)
The relevant source files are included and the solver can easily be built as follows
```
make cadical
```
## Compile and Build Solver
To compile the solver use
```
make
```
The binary can be found under `build/bin/serial-solver`
## Command-line usage
```
./serial-solver -p -f -fo
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:
To enumerate the preferred serialisation sequences, use
```
./serial-solver -p ES-PR -fo tgf -f
```