Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ECAI
/
Paper
The Complexity of Checking Redundancy of CNF Propositional Formulae.
Paolo Liberatore
Venue
A
ECAI
Year
2002
Proceedings
ECAI
DBLP record
conf/ecai/Liberatore02 ↗
Browse the full
ECAI paper archive
.