Bruno Zanuttini

Available identifiers

Publication	Date of Publication	Type
A knowledge compilation perspective on queries and transformations for belief tracking	2024-10-31	Paper
Knowledge-based programs as succinct policies for partially observable domains	2021-08-16	Paper
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis	2019-05-15	Paper
Strong partial clones and the time complexity of SAT problems	2016-11-14	Paper
Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems	2016-03-08	Paper
https://portal.mardi4nfdi.de/entity/Q3455569	2015-12-11	Paper
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms	2013-06-04	Paper
Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets	2010-12-14	Paper
Learning conditional preference networks	2010-09-02	Paper
A note on some collapse results of valued constraints	2010-08-16	Paper
What makes propositional abduction tractable	2009-07-17	Paper
An efficient algorithm for Horn description	2009-07-09	Paper
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains	2009-06-22	Paper
Structure identification of Boolean relations and plain bases for co-clones	2008-11-19	Paper
Automated Reasoning	2007-09-25	Paper
A Complete Classification of the Complexity of Propositional Abduction	2006-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4737597	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4434165	2003-11-04	Paper

This page was built for person: Bruno Zanuttini