On using satisfiability-based pruning techniques in covering algorithms
Vasco M. Manquinho, João P. Marques-Silva · 2000
Article On using satisfiability-based pruning techniques in covering algorithms Share on Authors: Vasco M. Manquinho Department of Informatics, Technical University of Lisbon, INESC/CEL, Lisbon, Portugal Department of Informatics, Technical University of Lisbon, INESC/CEL, Lisbon, PortugalView Profile , João Marques-Silva Department of Informatics, Technical University of Lisbon, INESC/CEL, Lisbon, Portugal Department of Informatics, Technical University of Lisbon, INESC/CEL, Lisbon, PortugalView Profile Authors Info & Claims DATE '00: Proceedings of the conference on Design, automation and test in EuropeJanuary 2000 Pages 356–363https://doi.org/10.1145/343647.343797Online:01 January 2000Publication History 8citation121DownloadsMetricsTotal Citations8Total Downloads121Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access