Metadata-Version: 2.3
Name: fASP
Version: 0.3.0
Summary: Efficient enumeration of fixed points in Boolean networks using answer set programming
Project-URL: Code, https://github.com/giang-trinh/fASP
Author-email: Sylvain Soliman <Sylvain.Soliman@inria.fr>, Van-Giang Trinh <giang.trinh91@gmail.com>
License-Expression: GPL-3.0
License-File: LICENSE
Classifier: Development Status :: 4 - Beta
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3
Requires-Python: >=3.6
Requires-Dist: networkx>=2.2
Requires-Dist: pyeda>=0.28
Provides-Extra: dev
Requires-Dist: black; extra == 'dev'
Requires-Dist: flake8-mypy; extra == 'dev'
Description-Content-Type: text/markdown

# fASP
Efficient enumeration of fixed points in Boolean networks using answer set programming

# Install

You can install fASP with `pip` directly from the Package Index:

``` sh
$ python3 -m pip install fASP
```

You will also need the `clingo` ASP solver in your PATH.
Instructions are provided directly on the [Potassco pages](https://github.com/potassco/clingo/releases/).

# Run fASP from the command line

After installing `fASP` (and `clingo`), just run

```
$ fASP -h
usage: fASP [-h] [-v] [-m MAX] [-t TIME] [-e {conj,disj,source}] [infile]

Compute fixed points of complex Boolean networks. Copyright (C) 2023 Sylvain.Soliman@inria.fr and giang.trinh91@gmail.com GPLv3

positional arguments:
  infile                BoolNet (.bnet) file

optional arguments:
  -h, --help            show this help message and exit
  -v, --version         show program's version number and exit
  -m MAX, --max MAX     Maximum number of solutions (0 for all).
  -t TIME, --time TIME  Maximum number of seconds for search (0 for no-limit).
  -e {conj,disj,source}, --encoding {conj,disj,source}
                        ASP encoding to compute fixed points.
```
