dc.contributor.author | Kučera, Petr | |
dc.contributor.editor | Yap, Roland C. H. | |
dc.date.accessioned | 2024-03-04T09:12:32Z | |
dc.date.available | 2024-03-04T09:12:32Z | |
dc.date.issued | 2023 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14178/2322 | |
dc.description.abstract | A binary constraint tree (BCT, Wang and Yap 2022) is a normalized binary CSP whose constraint graph is a tree. A BCT constraint is a constraint represented with a BCT where some of the variables may be hidden (i.e. existentially quantified and used only for internal representation). Structured decomposable negation normal forms (SDNNF) were introduced by Pipatsrisawat and Darwiche (2008) as a restriction of decomposable negation normal forms (DNNF). Both DNNFs and SDNNFs were studied in the area of knowledge compilation. In this paper we show that the BCT constraints are polynomially equivalent to SDNNFs. In particular, a BCT constraint can be represented with an SDNNF of polynomial size and, on the other hand, a constraint that can be represented with an SDNNF, can be represented as a BCT constraint of polynomial size. This generalizes the result of Wang and Yap (2022) that shows that a multivalued decision diagram (MDD) can be represented with a BCT. Moreover, our result provides a full characterization of binary constraint trees using a language that is well studied in the area of knowledge compilation. It was shown by Wang and Yap (2023) that a CSP on n variables of domain sizes bounded by d that has treewidth k can be encoded as a BCT on O(n) variables with domain sizes O(dk+1). We provide an alternative reduction for the case of binary CSPs. This allows us to compile any binary CSP to an SDNNF of size that is parameterized by d and k. | en |
dc.language.iso | en | |
dc.publisher | Schloss-Dagstuhl - Leibniz Zentrum für Informatik | |
dc.relation.url | https://doi.org/10.4230/LIPIcs.CP.2023.22 | |
dc.rights | Creative Commons Uveďte původ 4.0 International | cs |
dc.rights | Creative Commons Attribution 4.0 International | en |
dc.title | Binary Constraint Trees and Structured Decomposability | en |
dcterms.accessRights | openAccess | |
dcterms.license | https://creativecommons.org/licenses/by/4.0/legalcode | |
dc.date.updated | 2024-03-04T09:12:32Z | |
dc.subject.keyword | Binary Constraint Tree | en |
dc.subject.keyword | Binary CSP | en |
dc.subject.keyword | Polynomial Equivalence | en |
dc.subject.keyword | Structured Decomposability | en |
dc.subject.keyword | Strucured DNNF | en |
dc.relation.fundingReference | info:eu-repo/grantAgreement/UK/I-UK/I-MFF | |
dc.relation.fundingReference | info:eu-repo/grantAgreement/UK/COOP/COOP | |
dc.date.embargoStartDate | 2024-03-04 | |
dc.type.obd | 57 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | |
dc.identifier.doi | 10.4230/LIPIcs.CP.2023.22 | |
dc.identifier.eidScopus | 2-s2.0-85174073480 | |
dc.identifier.obd | 645458 | |
dc.subject.rivPrimary | 10000::10200::10201 | |
dcterms.isPartOf.name | Leibniz International Proceedings in Informatics, LIPIcs | |
dcterms.isPartOf.eissn | 1868-8969 | |
dcterms.isPartOf.journalYear | 2023 | |
dcterms.isPartOf.journalVolume | 280 | |
dcterms.isPartOf.isbn | 978-3-95977-300-3 | |
uk.faculty.primaryId | 116 | |
uk.faculty.primaryName | Matematicko-fyzikální fakulta | cs |
uk.faculty.primaryName | Faculty of Mathematics and Physics | en |
uk.department.primaryId | 1295 | |
uk.department.primaryName | Katedra teoretické informatiky a matematické logiky | cs |
uk.department.primaryName | Department of Theoretical Computer Science and Mathematical Logic | en |
uk.event.name | CP 2023 | |
dc.description.pageRange | 1-19 | |
dc.type.obdHierarchyCs | PŘÍSPĚVEK V KONFERENČNÍM SBORNÍKU::příspěvek v konferenčním sborníku::příspěvek v recenzovaném konferenčním sborníku | cs |
dc.type.obdHierarchyEn | PAPER IN CONFERENCE PROCEEDINGS::article in proceedings::article in reviewed proceedings | en |
dc.type.obdHierarchyCode | 57::148::499 | en |
uk.displayTitle | Binary Constraint Trees and Structured Decomposability | en |