| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7297821 (Why is no real title available?) | 2021-01-19 | Paper |
How many variables are needed to express an existential positive query?
Theory of Computing Systems | 2019-09-05 | Paper |
| How many variables are needed to express an existential positive query? | 2018-07-18 | Paper |
Model checking existential logic on partially ordered sets
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Free weak nilpotent minimum algebras
Soft Computing | 2018-02-23 | Paper |
On compiling structured CNFs to OBDDs
Theory of Computing Systems | 2017-10-20 | Paper |
| First-order queries on finite abelian groups | 2017-08-31 | Paper |
Proof search in Hájek's basic logic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Model checking existential logic on partially ordered sets
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Quantified conjunctive queries on partially ordered sets
Theoretical Computer Science | 2016-02-18 | Paper |
On compiling CNFs into structured deterministic DNNFs
Lecture Notes in Computer Science | 2015-11-20 | Paper |
On compiling structured CNFs to OBDDs
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Quantified conjunctive queries on partially ordered sets
Parameterized and Exact Computation | 2015-09-15 | Paper |
The complexity of equivalence, entailment, and minimization in existential positive logic
Journal of Computer and System Sciences | 2014-11-24 | Paper |
Unification and projectivity in De Morgan and Kleene algebras.
Order | 2014-08-01 | Paper |
| scientific article; zbMATH DE number 6276274 (Why is no real title available?) | 2014-04-01 | Paper |
Generic expression hardness results for primitive positive formula comparison
Information and Computation | 2013-06-06 | Paper |
Polynomial space hardness without disjunction property
Theoretical Computer Science | 2013-02-19 | Paper |
Lewis dichotomies in many-valued logics
Studia Logica | 2013-02-18 | Paper |
On the expression complexity of equivalence and isomorphism of primitive positive formulas
Theory of Computing Systems | 2012-12-06 | Paper |
Finite RDP-algebras: duality, coproducts and logic
Journal of Logic and Computation | 2012-06-20 | Paper |
The free \(n\)-generated BL-algebra
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Generic expression hardness results for primitive positive formula comparison
Lecture Notes in Computer Science | 2011-07-07 | Paper |
The coherence of Łukasiewicz assessments is NP-complete
International Journal of Approximate Reasoning | 2010-07-20 | Paper |
Soft Constraints Processing over Divisible Residuated Lattices
Lecture Notes in Computer Science | 2009-07-02 | Paper |
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Theoretical Computer Science | 2009-03-25 | Paper |
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras
Logical Foundations of Computer Science | 2009-02-24 | Paper |
