PBS

Reads as input both: CNF constraints, PB constraints (e.g. -2x + 3y + . + 6z <= 7, where x, y, and z are Boolean literals.) Can be used to solve decision (Yes/No) and optimization (Max/Min) problems. Includes incremental features. PBS options include: Static/Dynamic decision heuristics, 1-UIP conflict diagnosis, Random restarts and backtracking


References in zbMATH (referenced in 37 articles )

Showing results 1 to 20 of 37.
Sorted by year (citations)

1 2 next

  1. Achá, Roberto Asín; Nieuwenhuis, Robert: Curriculum-based course timetabling with SAT and MaxSAT (2014)
  2. Morgado, Antonio; Heras, Federico; Liffiton, Mark; Planes, Jordi; Marques-Silva, Joao: Iterative and core-guided maxsat solving: a survey and assessment (2013)
  3. Giunchiglia, Enrico; Maratea, Marco: Algorithms for solving satisfiability problems with qualitative preferences (2012)
  4. Coelho, José; Vanhoucke, Mario: Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (2011)
  5. Graça, Ana; Marques-Silva, João; Lynce, In^es; Oliveira, Arlindo L.: Haplotype inference with pseudo-Boolean optimization (2011)
  6. Liu, Guohua; Goebel, Randy; Janhunen, Tomi; Niemelä, Ilkka; You, Jia-Huai: Strong equivalence of logic programs with abstract constraint atoms (2011)
  7. Marques-Silva, Joao; Argelich, Josep; Graça, Ana; Lynce, In^es: Boolean lexicographic optimization: algorithms & applications (2011)
  8. Cimatti, Alessandro; Franzén, Anders; Griggio, Alberto; Sebastiani, Roberto; Stenico, Cristian: Satisfiability modulo the theory of costs: foundations and applications (2010)
  9. Di Rosa, Emanuele; Giunchiglia, Enrico; Maratea, Marco: Solving satisfiability problems with preferences (2010)
  10. Horbach, Andrei: A Boolean satisfiability approach to the resource-constrained project scheduling problem (2010)
  11. Aloul, Fadi A.; Ramani, Arathi; Markov, Igor L.; Sakallah, Karem A.: Dynamic symmetry-breaking for Boolean satisfiability (2009)
  12. Bailleux, Olivier; Boufkhad, Yacine; Roussel, Olivier: New encodings of pseudo-Boolean constraints into CNF (2009)
  13. Fujita, Masahiro; Seto, Kenshu; Sakunkonchak, Thanyapat: Dependence graph based verification and synthesis of hardware/software co-designs with SAT related formulation (2009)
  14. Manquinho, Vasco; Marques-Silva, Joao; Planes, Jordi: Algorithms for weighted Boolean optimization (2009)
  15. Sabharwal, Ashish: SymChaff: Exploiting symmetry in a structure-aware satisfiability solver (2009)
  16. Chaki, Sagar; Strichman, Ofer: Three optimizations for assume-guarantee reasoning with $L^*$ (2008)
  17. Marek, Victor W.; Niemelä, Ilkka; Truszczyński, Mirosław: Logic programs with monotone abstract constraint atoms (2008)
  18. Aloul, Fadi A.; Ramani, Arathi; Sakallah, Karem A.; Markov, Igor L.: Solution and optimization of systems of pseudo-Boolean constraints (2007)
  19. Fränzle, Martin; Herde, Christian: HySAT: An efficient proof engine for bounded model checking of hybrid systems (2007)
  20. Ganai, Malay K.; Talupur, Muralidhar; Gupta, Aarti: SDSAT: Tight integration of small domain encoding and lazy approaches in solving difference logic. (2007)

1 2 next