Tree decomposition with function filtering.
Lecture Notes in Computer Science. 3709:593-606.
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.
14th International Conference on Principles and Practice of Constraint Programming (CP-2008). 5202:582-587.
Towards Solving Many-Valued MaxSAT.
Proceedings, 36th International Symposium on Multiple-Valued Logics (ISMVL-2006), Singapore.
Towards Industrial-Like Random SAT Instances.
Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAI'09. :387-392.
The uses of norms.
Normative Multi-Agent Systems. :191–229.
The logic of quasi-MV algebras.
Journal of Logic and Computation. 20:619-643.
The Logic Behind Weighted CSP.
Future and Trends in Constraint Programming. :307-320.
The Logic behind Weighted CSP.
Proc. of the 20th International Joint Conference on Artificial Intelligence, IJCAI'07. :32-37.
The First and Second Max-SAT Evaluations.
Journal on Satisfiability, Boolean Modeling and Computation. 4:251-278.
The epistemic structure of de Finetti's betting problem.
9th Italian Convention on Computational Logic (CILC 2012). 857:241–245.
A target-oriented discussion framework to support collective decision making.
Multi-Agent Systems and Agreement Technologies. 14th European Conference, EUMAS 2016, and 4th International Conference, AT 2016, Valencia, Spain, December 15-16, 2016, Revised Selected Papers. Lecture Notes in Artificial Intelligence