Hard satisfiable clause sets for benchmarking equivalence  reasoning techniques

Forskningsoutput: Tidskriftsbidrag › Artikel › Vetenskaplig › Peer review

Originalspråk	engelska
Tidskrift	Journal on Satisfiability, Boolean Modeling and Computation
Volym	2
Sidor (från-till)	27-46
Antal sidor	20
ISSN	1875-5011
Status	Publicerad - 2006
MoE-publikationstyp	A1 Tidskriftsartikel-refererad

Vetenskapsgrenar

@article{82ef8ae838ff49e5835018e49c389dc2,

title = "Hard satisfiable clause sets for benchmarking equivalence reasoning techniques",

keywords = "113 Computer and information sciences",

author = "Harri Haanp{\"a}{\"a} and Matti J{\"a}rvisalo and Petteri Kaski",

year = "2006",

language = "English",

volume = "2",

pages = "27--46",

journal = "Journal on Satisfiability, Boolean Modeling and Computation",

issn = "1875-5011",

publisher = "IOS PRESS",

}

TY - JOUR

T1 - Hard satisfiable clause sets for benchmarking equivalence reasoning techniques

AU - Haanpää, Harri

AU - Järvisalo, Matti

AU - Kaski, Petteri

PY - 2006

Y1 - 2006

KW - 113 Computer and information sciences

M3 - Article

SN - 1875-5011

VL - 2

SP - 27

EP - 46

JO - Journal on Satisfiability, Boolean Modeling and Computation

JF - Journal on Satisfiability, Boolean Modeling and Computation

ER -