Institute of Information Security and Dependability (KASTEL) – Application-oriented Formal Verification
Institute of Information Security and Dependability (KASTEL) – Application-oriented Formal Verification
Publications

The 2-SAT Problem of Regular Signed CNF Formulas

Reviewed Paper In Proceedings
Author(s):Bernhard Beckert, Reiner Hähnle, and Felip Manyà
In:30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)
Publisher:IEEE Computer Society
Year:2000
DOI:10.1109/ISMVL.2000.848640

BibTeX

@InProceedings{BeckertHaehnleManya2000,
  author    = {Bernhard Beckert and Reiner H\"ahnle and Felip Many\`a},
  title     = {The {2-SAT} Problem of Regular Signed {CNF} Formulas},
  booktitle = {30th {IEEE} International Symposium on Multiple-Valued
	       Logic ({ISMVL} 2000)},
  venue     = {Portland, Oregon, {USA}},
  publisher = {{IEEE} Computer Society},
  eventdate = {2000-05-23/2000-05-25},
  month     = may,
  year      = {2000} ,
  doi       = {10.1109/ISMVL.2000.848640}
}