Simone Bova | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/simone-bova/Simone BovaHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngSimone Bovahttps://ac.tuwien.ac.at/team/simone-bova/Circuit Treewidth, Sentential Decision, and Query Compilationhttps://ac.tuwien.ac.at/publication/circuit-treewidth-sentential-decision-and-query-compilation/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-treewidth-sentential-decision-and-query-compilation/Free Weak Nilpotent Minimum Algebrashttps://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras-2/Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Querieshttps://ac.tuwien.ac.at/publication/herbrand-property-finite-quasi-herbrand-models-and-lifting-chandra-merlin-theorem-to-quantified-conjunctive-queries/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/herbrand-property-finite-quasi-herbrand-models-and-lifting-chandra-merlin-theorem-to-quantified-conjunctive-queries/How many variables are needed to express an existential positive query?https://ac.tuwien.ac.at/publication/how-many-variables-are-needed-to-express-an-existential-positive-query/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/how-many-variables-are-needed-to-express-an-existential-positive-query/Knowledge Compilation Meets Communication Complexityhttps://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Model Checking Existential Logic on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/Positive and Negative Results for Parameterized Compilabilityhttps://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Quantified Conjunctive Queries on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/SDDs Are Exponentially More Succinct than OBDDshttps://ac.tuwien.ac.at/publication/sdds-are-exponentially-more-succinct-than-obdds/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/sdds-are-exponentially-more-succinct-than-obdds/First-Order Queries on Finite Abelian Groupshttps://ac.tuwien.ac.at/publication/first-order-queries-on-finite-abelian-groups/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-queries-on-finite-abelian-groups/On Compiling CNFs into Structured Deterministic DNNFshttps://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/On Compiling Structured CNFs to OBDDshttps://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/The complexity of equivalence, entailment, and minimization in existential positive logichttps://ac.tuwien.ac.at/publication/the-complexity-of-equivalence-entailment-and-minimization-in-existential-positive-logic/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-equivalence-entailment-and-minimization-in-existential-positive-logic/Model checking existential logic on partially ordered setshttps://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/Quantified Conjunctive Queries on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/The Complexity of Width Minimization for Existential Positive Querieshttps://ac.tuwien.ac.at/publication/the-complexity-of-width-minimization-for-existential-positive-queries/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-width-minimization-for-existential-positive-queries/Unification and Projectivity in De Morgan and Kleene Algebrashttps://ac.tuwien.ac.at/publication/unification-and-projectivity-in-de-morgan-and-kleene-algebras/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/unification-and-projectivity-in-de-morgan-and-kleene-algebras/Generic expression hardness results for primitive positive formula comparisonhttps://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison-2/Polynomial space hardness without disjunction propertyhttps://ac.tuwien.ac.at/publication/polynomial-space-hardness-without-disjunction-property/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-space-hardness-without-disjunction-property/Finite RDP-algebras: duality, coproducts and logichttps://ac.tuwien.ac.at/publication/finite-rdp-algebras-duality-coproducts-and-logic/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/finite-rdp-algebras-duality-coproducts-and-logic/Lewis Dichotomies in Many-Valued Logicshttps://ac.tuwien.ac.at/publication/lewis-dichotomies-in-many-valued-logics/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lewis-dichotomies-in-many-valued-logics/On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulashttps://ac.tuwien.ac.at/publication/on-the-expression-complexity-of-equivalence-and-isomorphism-of-primitive-positive-formulas/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-expression-complexity-of-equivalence-and-isomorphism-of-primitive-positive-formulas/Generic Expression Hardness Results for Primitive Positive Formula Comparisonhttps://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison/Schauder Hats for the Two-Variable Fragment of BLhttps://ac.tuwien.ac.at/publication/schauder-hats-for-the-two-variable-fragment-of-bl/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/schauder-hats-for-the-two-variable-fragment-of-bl/The coherence of Łukasiewicz assessments is NP-completehttps://ac.tuwien.ac.at/publication/the-coherence-of-lukasiewicz-assessments-is-np-complete/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-coherence-of-lukasiewicz-assessments-is-np-complete/The free n-generated BL-algebrahttps://ac.tuwien.ac.at/publication/the-free-n-generated-bl-algebra/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-free-n-generated-bl-algebra/Applications of Finite Duality to Locally Finite Varieties of BL-Algebrashttps://ac.tuwien.ac.at/publication/applications-of-finite-duality-to-locally-finite-varieties-of-bl-algebras/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-finite-duality-to-locally-finite-varieties-of-bl-algebras/Soft Constraints Processing over Divisible Residuated Latticeshttps://ac.tuwien.ac.at/publication/soft-constraints-processing-over-divisible-residuated-lattices/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/soft-constraints-processing-over-divisible-residuated-lattices/The consequence relation in the logic of commutative GBL-algebras is PSPACE-completehttps://ac.tuwien.ac.at/publication/the-consequence-relation-in-the-logic-of-commutative-gbl-algebras-is-pspace-complete/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-consequence-relation-in-the-logic-of-commutative-gbl-algebras-is-pspace-complete/Proof search in Hájek's basic logichttps://ac.tuwien.ac.at/publication/proof-search-in-hajek-s-basic-logic/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-search-in-hajek-s-basic-logic/