<tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing

CLAIRE LEFÈVRE, CHRISTOPHER BÉATRIX, IGOR STÉPHAN, LAURENT GARCIA

Open source

DOI
10.1017/s1471068416000569
Published
2017-01-16
Container
Theory and Practice of Logic Programming
Publisher
Cambridge University Press (CUP)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1017/s1471068416000569,
  title = {<tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing},
  author = {CLAIRE LEFÈVRE and CHRISTOPHER BÉATRIX and IGOR STÉPHAN and LAURENT GARCIA},
  year = {2017},
  journal = {Theory and Practice of Logic Programming},
  doi = {10.1017/s1471068416000569},
  url = {https://doi.org/10.1017/s1471068416000569}
}

RIS

TY  - JOUR
TI  - <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing
AU  - CLAIRE LEFÈVRE
AU  - CHRISTOPHER BÉATRIX
AU  - IGOR STÉPHAN
AU  - LAURENT GARCIA
PY  - 2017
JO  - Theory and Practice of Logic Programming
DO  - 10.1017/s1471068416000569
UR  - https://doi.org/10.1017/s1471068416000569
ER  - 

APA

LEFÈVRE, C., BÉATRIX, C., STÉPHAN, I., & GARCIA, L. (2017). <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing. Theory and Practice of Logic Programming. https://doi.org/10.1017/s1471068416000569

Source records