default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimone Bova
Person information
- affiliation: TU Wien, Vienna, Austria
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j16]Simone Bova, Hubie Chen:
How Many Variables are Needed to Express an Existential Positive Query? Theory Comput. Syst. 63(7): 1573-1594 (2019)- 2017
- [j15]Simone Bova, Friedrich Slivovsky
:
On Compiling Structured CNFs to OBDDs. Theory Comput. Syst. 61(2): 637-655 (2017) - [j14]Stefano Aguzzoli, Simone Bova, Diego Valota:
Free weak nilpotent minimum algebras. Soft Comput. 21(1): 79-95 (2017) - [c17]Simone Bova, Hubie Chen:
How Many Variables Are Needed to Express an Existential Positive Query?. ICDT 2017: 9:1-9:16 - [c16]Simone Bova, Fabio Mogavero:
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. LICS 2017: 1-12 - [c15]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. PODS 2017: 233-246 - [i10]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. CoRR abs/1701.04626 (2017) - 2016
- [j13]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified conjunctive queries on partially ordered sets. Theor. Comput. Sci. 618: 72-84 (2016) - [j12]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. 17(2): 10 (2016) - [c14]Simone Bova:
SDDs Are Exponentially More Succinct than OBDDs. AAAI 2016: 929-935 - [c13]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Knowledge Compilation Meets Communication Complexity. IJCAI 2016: 1008-1014 - [i9]Simone Bova:
SDDs are Exponentially More Succinct than OBDDs. CoRR abs/1601.00501 (2016) - 2015
- [j11]Simone Bova, Hubie Chen:
The complexity of equivalence, entailment, and minimization in existential positive logic. J. Comput. Syst. Sci. 81(2): 443-457 (2015) - [c12]Simone Bova, Barnaby Martin:
First-Order Queries on Finite Abelian Groups. CSL 2015: 41-59 - [c11]Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. CSR 2015: 80-93 - [c10]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
On Compiling CNFs into Structured Deterministic DNNFs. SAT 2015: 199-214 - 2014
- [j10]Simone Bova, Leonardo Manuel Cabrer:
Unification and Projectivity in De Morgan and Kleene Algebras. Order 31(2): 159-187 (2014) - [c9]Simone Bova, Robert Ganian, Stefan Szeider:
Model checking existential logic on partially ordered sets. CSL-LICS 2014: 21:1-21:10 - [c8]Simone Bova, Hubie Chen:
The Complexity of Width Minimization for Existential Positive Queries. ICDT 2014: 235-244 - [c7]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. IPEC 2014: 122-134 - [i8]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. CoRR abs/1405.2891 (2014) - [i7]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. CoRR abs/1408.4263 (2014) - [i6]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Expander CNFs have Exponential DNNF Size. CoRR abs/1411.1995 (2014) - [i5]Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. CoRR abs/1411.5494 (2014) - 2013
- [j9]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. Inf. Comput. 222: 108-120 (2013) - [j8]Simone Bova, Franco Montagna:
Polynomial space hardness without disjunction property. Theor. Comput. Sci. 467: 1-11 (2013) - 2012
- [j7]Simone Bova, Diego Valota:
Finite RDP-algebras: duality, coproducts and logic. J. Log. Comput. 22(3): 417-450 (2012) - [j6]Simone Bova, Hubie Chen, Matthew Valeriote:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory Comput. Syst. 50(2): 329-353 (2012) - [j5]Simone Bova:
Lewis Dichotomies in Many-Valued Logics. Stud Logica 100(6): 1271-1290 (2012) - [i4]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. CoRR abs/1205.5745 (2012) - 2011
- [c6]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. ICALP (2) 2011: 344-355 - 2010
- [j4]Stefano Aguzzoli, Simone Bova:
The free n-generated BL-algebra. Ann. Pure Appl. Log. 161(9): 1144-1170 (2010) - [j3]Simone Bova, Tommaso Flaminio:
The coherence of Lukasiewicz assessments is NP-complete. Int. J. Approx. Reason. 51(3): 294-304 (2010) - [c5]Simone Bova, Pietro Codara, Daniele Maccari, Vincenzo Marra:
A logical analysis of Mamdani-type fuzzy inference, I theoretical bases. FUZZ-IEEE 2010: 1-8 - [c4]Simone Bova, Pietro Codara, Daniele Maccari, Vincenzo Marra:
A logical analysis of Mamdani-type fuzzy inference, II. An experiment on the technical analysis of financial markets. FUZZ-IEEE 2010: 1-8 - [c3]Stefano Aguzzoli, Simone Bova:
Schauder Hats for the Two-Variable Fragment of BL. ISMVL 2010: 27-32
2000 – 2009
- 2009
- [j2]Simone Bova, Franco Montagna:
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete. Theor. Comput. Sci. 410(12-13): 1143-1158 (2009) - [c2]Simone Bova:
Soft Constraints Processing over Divisible Residuated Lattices. ECSQARU 2009: 887-898 - [c1]Stefano Aguzzoli, Simone Bova, Vincenzo Marra:
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras. LFCS 2009: 1-15 - [i3]Matthew Valeriote, Simone Bova, Hubie Chen:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - 2008
- [j1]Simone Bova, Franco Montagna:
Proof search in Hájek's basic logic. ACM Trans. Comput. Log. 9(3): 21:1-21:26 (2008) - [i2]Simone Bova:
k-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices. CoRR abs/0805.3261 (2008) - 2006
- [i1]Simone Bova, Franco Montagna:
Proof Search in Hajek's Basic Logic. CoRR abs/cs/0605094 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
