Simone Bova

43 papers A* 4A 3B 4C 1Misc 2Journal 25Unranked 4
YearRankTypeTitle / Venue / Authors
2019 J jnl
How Many Variables are Needed to Express an Existential Positive Query?
Theory Comput. Syst.
Simone Bova, Hubie Chen
2017 A* conf
Circuit Treewidth, Sentential Decision, and Query Compilation.
PODS
Simone Bova, Stefan Szeider
2017 J jnl
Circuit Treewidth, Sentential Decision, and Query Compilation.
CoRR
Simone Bova, Stefan Szeider
2017 J jnl
Free weak nilpotent minimum algebras.
Soft Comput.
Stefano Aguzzoli, Simone Bova, Diego Valota
2017 A* conf
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries.
LICS
Simone Bova, Fabio Mogavero
2017 A conf
How Many Variables Are Needed to Express an Existential Positive Query?.
ICDT
Simone Bova, Hubie Chen
2017 J jnl
On Compiling Structured CNFs to OBDDs.
Theory Comput. Syst.
Simone Bova, Friedrich Slivovsky
2016 A* conf
Knowledge Compilation Meets Communication Complexity.
IJCAI
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2016 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log.
Simone Bova, Robert Ganian, Stefan Szeider
2016 J jnl
Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci.
Simone Bova, Robert Ganian, Stefan Szeider
2016 A* conf
SDDs Are Exponentially More Succinct than OBDDs.
AAAI
Simone Bova
2016 J jnl
SDDs are Exponentially More Succinct than OBDDs.
CoRR
Simone Bova
2015 B conf
First-Order Queries on Finite Abelian Groups.
CSL
Simone Bova, Barnaby Martin
2015 A conf
On Compiling CNFs into Structured Deterministic DNNFs.
SAT
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2015 Misc conf
On Compiling Structured CNFs to OBDDs.
CSR
Simone Bova, Friedrich Slivovsky
2015 J jnl
The complexity of equivalence, entailment, and minimization in existential positive logic.
J. Comput. Syst. Sci.
Simone Bova, Hubie Chen
2014 J jnl
Expander CNFs have Exponential DNNF Size.
CoRR
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2014 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2014 — conf
Model checking existential logic on partially ordered sets.
CSL-LICS
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
On Compiling Structured CNFs to OBDDs.
CoRR
Simone Bova, Friedrich Slivovsky
2014 B conf
Quantified Conjunctive Queries on Partially Ordered Sets.
IPEC
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
Quantified Conjunctive Queries on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2014 A conf
The Complexity of Width Minimization for Existential Positive Queries.
ICDT
Simone Bova, Hubie Chen
2014 J jnl
Unification and Projectivity in De Morgan and Kleene Algebras.
Order
Simone Bova, Leonardo Manuel Cabrer
2013 J jnl
Generic expression hardness results for primitive positive formula comparison.
Inf. Comput.
Simone Bova, Hubie Chen, Matthew Valeriote
2013 J jnl
Polynomial space hardness without disjunction property.
Theor. Comput. Sci.
Simone Bova, Franco Montagna
2012 J jnl
Finite RDP-algebras: duality, coproducts and logic.
J. Log. Comput.
Simone Bova, Diego Valota
2012 J jnl
Generic Expression Hardness Results for Primitive Positive Formula Comparison
CoRR
Simone Bova, Hubie Chen, Matthew Valeriote
2012 J jnl
Lewis Dichotomies in Many-Valued Logics.
Stud Logica
Simone Bova
2012 J jnl
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
Theory Comput. Syst.
Simone Bova, Hubie Chen, Matthew Valeriote
2011 — conf
Generic Expression Hardness Results for Primitive Positive Formula Comparison.
ICALP (2)
Simone Bova, Hubie Chen, Matthew Valeriote
2010 B conf
A logical analysis of Mamdani-type fuzzy inference, I theoretical bases.
FUZZ-IEEE
Simone Bova, Pietro Codara, Daniele Maccari, Vincenzo Marra
2010 B conf
A logical analysis of Mamdani-type fuzzy inference, II. An experiment on the technical analysis of financial markets.
FUZZ-IEEE
Simone Bova, Pietro Codara, Daniele Maccari, Vincenzo Marra
2010 — conf
Schauder Hats for the Two-Variable Fragment of BL.
ISMVL
Stefano Aguzzoli, Simone Bova
2010 J jnl
The coherence of Lukasiewicz assessments is NP-complete.
Int. J. Approx. Reason.
Simone Bova, Tommaso Flaminio
2010 J jnl
The free n-generated BL-algebra.
Ann. Pure Appl. Log.
Stefano Aguzzoli, Simone Bova
2009 Misc conf
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras.
LFCS
Stefano Aguzzoli, Simone Bova, Vincenzo Marra
2009 — conf
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
The Constraint Satisfaction Problem: Complexity and Approximability
Matthew Valeriote, Simone Bova, Hubie Chen
2009 C conf
Soft Constraints Processing over Divisible Residuated Lattices.
ECSQARU
Simone Bova
2009 J jnl
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete.
Theor. Comput. Sci.
Simone Bova, Franco Montagna
2008 J jnl
Proof search in Hájek's basic logic.
ACM Trans. Comput. Log.
Simone Bova, Franco Montagna
2008 J jnl
k-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices
CoRR
Simone Bova
2006 J jnl
Proof Search in Hajek's Basic Logic
CoRR
Simone Bova, Franco Montagna