#acl EditorsGroup:read,write,delete,revert,admin All:read

= LP2SAT =

== Team ==
 * Tomi Janhunen (Aalto University) 
 * Guohua Liu (Aalto University)
 * Jori Bomanson (Aalto University) 
 * Ilkka Niemelä (Aalto University)

== Description ==
A given ASP program is grounded by GRINGO and the ground program is simplified by SMODELS, then the simplified program is normalized using LP2NORMAL2 and translated to SAT clauses using LP2LP2 and LP2SAT, and finally, the SAT clauses are solved by PRECOSAT.

== System Settings ==
The main modules and option flags are as below: 
 * GRINGO 3.0.4 --shift, 
 * SMODELS 2.34 -internal -nolookahead
 * LP2NORMAL2 1.1 -wp -wt -wh -wn -wy -cs
 * LP2LP2 1.18 
 * LP2SAT 1.15 -n
 * PRECOSAT 570

The input language is Gringo 3.
  
== References ==
 * Participant [[http://research.ics.aalto.fi/software/asp/lp2sat|URL]].  
 * Tomi Janhunen and Ilkka Niemelä, ''Compact Translations of Non-Disjunctive Answer Set Programs to Propositional Clauses'', In Gelfond Festschrift, 111—130, 2010. Springer LNCS 6565.
 * A paper on LP2NORMAL2 has been submitted.
 
== bibtex entry ==
@inproceedings{JN11:scmcs,
    author = {Tomi Janhunen and Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the Symposium on Constructive Mathematics and 
                 Computer Science in Honour of Michael Gelfonds 65th Anniversary},
    pages = {111--130},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Compact Translations of Non-Disjunctive Answer Set Programs to 
             Propositional Clauses},
    volume = {6565},
    year = {2011},
}