Show simple item record

dc.contributor.authorBailey, J
dc.contributor.authorStuckey, PJ
dc.contributor.editorHermenegildo, M
dc.contributor.editorCabeza, D
dc.date.available2014-05-22T04:36:36Z
dc.date.issued2005-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000228100000014&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationBailey, J. & Stuckey, P. J. (2005). Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. SPRINGER-VERLAG BERLIN. Long Beach, CA.
dc.identifier.isbn3-540-24362-3
dc.identifier.isbn9783540243625
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11343/31923
dc.descriptionInternational Symposium on Practical Applications of Declarative Languages
dc.languageEnglish
dc.publisherSPRINGER-VERLAG BERLIN
dc.source7th International Symposium on Practical Aspects of Declarative Languages (PADL)
dc.subjectArtificial Intelligence and Image Processing
dc.titleDiscovery of minimal unsatisfiable subsets of constraints using hitting set dualization
dc.typeConference Paper
dc.identifier.doi10.1007/978-3-540-30557-6_14
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titlePRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PROCEEDINGS
melbourne.source.volume3350
melbourne.source.pages174-186
dc.research.codefor0801
melbourne.publicationid40365
melbourne.elementsid270651
melbourne.contributor.authorBailey, James
melbourne.contributor.authorStuckey, Peter
dc.identifier.eissn1611-3349
melbourne.conference.locationLong Beach, CA
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record