Encodings of Problems in Effectively Propositional Logic

  • Juan Antonio Navarro-Pérez
  • Andrei Voronkov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4501)

Abstract

Solving various combinatorial problems by their translation to the propositional satisfiability problem has become commonly accepted. By optimising such translations and using efficient SAT solvers one can often solve hard problems in various domains, such as formal verification and planning.

References

  1. 1.
    Biere, A., et al.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  2. 2.
    Fikes, R., Nilsson, N.J.: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3-4), 189–208 (1971)MATHCrossRefGoogle Scholar
  3. 3.
    McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)MATHGoogle Scholar
  4. 4.
    Sutcliffe, G., Suttner, C.B.: The state of CASC. AI Communications 19(1), 35–48 (2006)MATHMathSciNetGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Juan Antonio Navarro-Pérez
    • 1
  • Andrei Voronkov
    • 1
  1. 1.The University of Manchester School of Computer Science 

Personalised recommendations