# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "satire" in publications use:'
type: software
license: MIT
title: 'satire: Define and Solve Boolean Satisfiability (''SAT'') Problems'
version: 1.0.0.9000
doi: 10.32614/CRAN.package.satire
abstract: Boolean satisifiability ('SAT') tests whether there are sets of variables
  which satisfy a Boolean formula. This package provides tools for defining 'SAT'
  problems and includes a 'DPLL'-based 'SAT' solver based upon Davis & Putnam (1960)
  <https://doi.org/10.1145/321033.321034>. Built-in capabilities for Tseytin transformation
  (Tseytin (1968) <https://doi.org/10.1007/978-3-642-81955-1_28>) allows for the input
  of complex Boolean formula. Cardinalility constraints are implemented using commander
  variables (Klieber & Kwon (2007) <https://www.cs.cmu.edu/~wklieber/papers/2007_efficient-cnf-encoding-for-selecting-1.pdf>)
  and sequential counters (Sinz (2005) <https://doi.org/10.1007/11564751_73>). Tools
  for reading and writing 'DIMACS' files are also included.
authors:
- family-names: Cheng
  given-names: Mike
  email: mikefc@coolbutuseless.com
repository: https://coolbutuseless.r-universe.dev
repository-code: https://github.com/coolbutuseless/satire
commit: 2bb32cf1a319d6f95a7a67330ebccaaff741de8d
url: https://github.com/coolbutuseless/satire
date-released: '2025-04-07'
contact:
- family-names: Cheng
  given-names: Mike
  email: mikefc@coolbutuseless.com