Author of the publication

Minimal Inference Problem Over Finite Domains: The Landscape of Complexity.

. LPNMR, volume 10377 of Lecture Notes in Computer Science, page 101-113. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Complexity of Minimal Inference Problem for Conservative Constraint Languages.. ACM Trans. Comput. Log., 20 (2): 8:1-8:35 (2019)Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction., and . TIME, page 99-106. IEEE Computer Society, (2012)Quantified Positive Temporal Constraints., and . CSL, volume 5213 of Lecture Notes in Computer Science, page 94-108. Springer, (2008)Syntactically Characterizing Local-to-Global Consistency in ORD-Horn.. CP, volume 7514 of Lecture Notes in Computer Science, page 704-719. Springer, (2012)Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems.. CoRR, (2021)Identifying Tractable Quantified Temporal Constraints within Ord-Horn., , and . CoRR, (2024)Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems.. MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 535-546. Springer, (2014)The complete classification for quantified equality constraints., , and . SODA, page 2746-2760. SIAM, (2023)Smooth Approximations and Relational Width Collapses., , , and . ICALP, volume 198 of LIPIcs, page 138:1-138:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices., and . ISMVL, page 21. IEEE Computer Society, (2007)