Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/aig-hagen/taas-harper
A very fast solver for polynomial tasks in abstract argumentation pertaining to grounded and complete semantics
https://github.com/aig-hagen/taas-harper
Last synced: 8 days ago
JSON representation
A very fast solver for polynomial tasks in abstract argumentation pertaining to grounded and complete semantics
- Host: GitHub
- URL: https://github.com/aig-hagen/taas-harper
- Owner: aig-hagen
- License: gpl-3.0
- Created: 2022-07-19T12:49:23.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-07-19T13:05:09.000Z (over 2 years ago)
- Last Synced: 2024-11-13T11:41:55.670Z (2 months ago)
- Language: C
- Size: 34.2 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# taas-harper v2. (2020-10-02)
Matthias Thimm ([email protected])
In order to compile taas-harper you need glib 2.0 header files
(https://developer.gnome.org/glib/).
Then compile taas-harper via
```
gcc taas-harper.c `pkg-config --cflags --libs glib-2.0` -o taas-harper
```
taas-harper uses a probo-compliant command line interface, see also
http://argumentationcompetition.org/2015/iccma15notes_v3.pdf.
taas-harper implements the problems [SE-GR,EE-GR,DC-GR,DS-GR,SE-CO,DS-CO] and
supports the TGF format for abstract argumentation frameworks. In particular,
to compute the grounded extension of an AAF in TGF format use
```
taas-harper -p SE-GR -fo TGF -f
```