Bruno Zanuttini

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A knowledge compilation perspective on queries and transformations for belief tracking Annals of Mathematics and Artificial Intelligence	2024-10-31	Paper
Knowledge-based programs as succinct policies for partially observable domains Artificial Intelligence	2021-08-16	Paper
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-05-15	Paper
Strong partial clones and the time complexity of SAT problems Journal of Computer and System Sciences	2016-11-14	Paper
Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems Artificial Intelligence	2016-03-08	Paper
Knowledge-based programs as plans. The complexity of plan verification	2015-12-11	Paper
Some new tractable classes of CSPs and their relations with backtracking algorithms Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems	2013-06-04	Paper
Learning ordinal preferences on multiattribute domains: the case of CP-nets Preference Learning	2010-12-14	Paper
Learning conditional preference networks Artificial Intelligence	2010-09-02	Paper
A note on some collapse results of valued constraints Information Processing Letters	2010-08-16	Paper
What makes propositional abduction tractable Artificial Intelligence	2009-07-17	Paper
An efficient algorithm for Horn description Information Processing Letters	2009-07-09	Paper
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains SIAM Journal on Computing	2009-06-22	Paper
Structure identification of Boolean relations and plain bases for co-clones Journal of Computer and System Sciences	2008-11-19	Paper
Automated Reasoning Lecture Notes in Computer Science	2007-09-25	Paper
A Complete Classification of the Complexity of Propositional Abduction SIAM Journal on Computing	2006-06-01	Paper
scientific article; zbMATH DE number 2086980 (Why is no real title available?)	2004-08-11	Paper
scientific article; zbMATH DE number 2000816 (Why is no real title available?)	2003-11-04	Paper

Research outcomes over time

This page was built for person: Bruno Zanuttini