Advances in Artificial Intelligence -- IBERAMIA 2014

@inproceedings{Martinez2014AdvancesIA,
  title={Advances in Artificial Intelligence -- IBERAMIA 2014},
  author={Maria Vanina Martinez and Cristhian A. D. Deagustini and Marcelo A. Falappa and Guillermo Ricardo Simari},
  booktitle={Lecture Notes in Computer Science},
  year={2014}
}
We present a parsing approach to address the problem of propositional satisfiability (SAT). We use a very simple translation from formulae in conjunctive normal form (CNF) to strings to be parsed by an Earley type algorithm. The parsing approach enables both a SAT and an ALL-SAT solver. The parsing algorithm is based in a model of automata that uses… CONTINUE READING