k-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices - Simone Bova (CoRR, 2008)

Proof search in Hájek's basic logic. - Simone Bova; Franco Montagna (ACM Trans. Comput. Log., 2008)

Soft Constraints Processing over Divisible Residuated Lattices. - Simone Bova (ECSQARU, 2009)

Applications of Finite Duality to Locally Finite Varieties of BL-Algebras. - Stefano Aguzzoli; Simone Bova; Vincenzo Marra (LFCS, 2009)

The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete. - Simone Bova; Franco Montagna (Theor. Comput. Sci., 2009)

A logical analysis of Mamdani-type fuzzy inference, I theoretical bases. - Simone Bova; Pietro Codara; Daniele Maccari; Vincenzo Marra (FUZZ-IEEE, 2010)

A logical analysis of Mamdani-type fuzzy inference, II. An experiment on the technical analysis of financial markets. - Simone Bova; Pietro Codara; Daniele Maccari; Vincenzo Marra (FUZZ-IEEE, 2010)

Schauder Hats for the Two-Variable Fragment of BL. - Stefano Aguzzoli; Simone Bova (ISMVL, 2010)

The free n-generated BL-algebra. - Stefano Aguzzoli; Simone Bova (Ann. Pure Appl. Log., 2010)

The coherence of Lukasiewicz assessments is NP-complete. - Simone Bova; Tommaso Flaminio (Int. J. Approx. Reason., 2010)

Finite RDP-algebras: duality, coproducts and logic. - Simone Bova; Diego Valota (J. Log. Comput., 2012)

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. - Simone Bova; Hubie Chen; Matthew Valeriote (Theory Comput. Syst., 2012)

Lewis Dichotomies in Many-Valued Logics. - Simone Bova (Stud Logica, 2012)

Generic expression hardness results for primitive positive formula comparison. - Simone Bova; Hubie Chen; Matthew Valeriote (Inf. Comput., 2013)

Polynomial space hardness without disjunction property. - Simone Bova; Franco Montagna (Theor. Comput. Sci., 2013)

The Complexity of Width Minimization for Existential Positive Queries. - Simone Bova; Hubie Chen (ICDT, 2014)

Expander CNFs have Exponential DNNF Size. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (CoRR, 2014)

Unification and Projectivity in De Morgan and Kleene Algebras. - Simone Bova; Leonardo Manuel Cabrer (Order, 2014)

First-Order Queries on Finite Abelian Groups. - Simone Bova; Barnaby Martin (CSL, 2015)

On Compiling CNFs into Structured Deterministic DNNFs. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (SAT, 2015)

The complexity of equivalence, entailment, and minimization in existential positive logic. - Simone Bova; Hubie Chen (J. Comput. Syst. Sci., 2015)

SDDs Are Exponentially More Succinct than OBDDs. - Simone Bova (AAAI, 2016)

Knowledge Compilation Meets Communication Complexity. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (IJCAI, 2016)

Quantified conjunctive queries on partially ordered sets. - Simone Bova; Robert Ganian; Stefan Szeider (Theor. Comput. Sci., 2016)

Model Checking Existential Logic on Partially Ordered Sets. - Simone Bova; Robert Ganian; Stefan Szeider (ACM Trans. Comput. Log., 2016)

Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. - Simone Bova; Fabio Mogavero (LICS, 2017)

Circuit Treewidth, Sentential Decision, and Query Compilation. - Simone Bova; Stefan Szeider (PODS, 2017)

On Compiling Structured CNFs to OBDDs. - Simone Bova; Friedrich Slivovsky (Theory Comput. Syst., 2017)

Free weak nilpotent minimum algebras. - Stefano Aguzzoli; Simone Bova; Diego Valota (Soft Comput., 2017)

How Many Variables are Needed to Express an Existential Positive Query? - Simone Bova; Hubie Chen (Theory Comput. Syst., 2019)