Search Results for author:
Found 5 papers, 0 papers with code
Proceedings of the 2023 XCSP3 Competition
This document represents the proceedings of the 2023 XCSP3 Competition.
Proceedings of the 2022 XCSP3 Competition
This document represents the proceedings of the 2022 XCSP3 Competition.
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Under the same assumption, we present a pseudo polynomial-time algorithm that transforms $C$ into a d-DNNF circuit $C'$ satisfied exactly by the models of $C$ having a value among the top-$k$ ones.
Design and Results of ICCMA 2021
This paper discusses the design of the Fourth International Competition on Computational Models of Argumentation.
On the Complexity of Optimization Problems based on Compiled NNF Representations
When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.
