Simone Bova

Orcid: 0000-0002-1069-7257

Affiliations:
  • TU Wien, Vienna, Austria


According to our database1, Simone Bova authored at least 30 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
How Many Variables are Needed to Express an Existential Positive Query?
Theory Comput. Syst., 2019

2017
Free weak nilpotent minimum algebras.
Soft Comput., 2017

On Compiling Structured CNFs to OBDDs.
Theory Comput. Syst., 2017

Circuit Treewidth, Sentential Decision, and Query Compilation.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log., 2016

Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci., 2016

Knowledge Compilation Meets Communication Complexity.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

SDDs Are Exponentially More Succinct than OBDDs.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
The complexity of equivalence, entailment, and minimization in existential positive logic.
J. Comput. Syst. Sci., 2015

On Compiling CNFs into Structured Deterministic DNNFs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

First-Order Queries on Finite Abelian Groups.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Unification and Projectivity in De Morgan and Kleene Algebras.
Order, 2014

Expander CNFs have Exponential DNNF Size.
CoRR, 2014

The Complexity of Width Minimization for Existential Positive Queries.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2013
Polynomial space hardness without disjunction property.
Theor. Comput. Sci., 2013

Generic expression hardness results for primitive positive formula comparison.
Inf. Comput., 2013

2012
Lewis Dichotomies in Many-Valued Logics.
Stud Logica, 2012

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
Theory Comput. Syst., 2012

Finite RDP-algebras: duality, coproducts and logic.
J. Log. Comput., 2012

2010
The coherence of Lukasiewicz assessments is NP-complete.
Int. J. Approx. Reason., 2010

The free n-generated BL-algebra.
Ann. Pure Appl. Log., 2010

Schauder Hats for the Two-Variable Fragment of BL.
Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

A logical analysis of Mamdani-type fuzzy inference, II. An experiment on the technical analysis of financial markets.
Proceedings of the FUZZ-IEEE 2010, 2010

A logical analysis of Mamdani-type fuzzy inference, I theoretical bases.
Proceedings of the FUZZ-IEEE 2010, 2010

2009
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete.
Theor. Comput. Sci., 2009

Applications of Finite Duality to Locally Finite Varieties of BL-Algebras.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Soft Constraints Processing over Divisible Residuated Lattices.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

2008
Proof search in Hájek's basic logic.
ACM Trans. Comput. Log., 2008

k-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices
CoRR, 2008


  Loading...