| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7700603 (Why is no real title available?) | 2023-06-23 | Paper |
Meta-rule synthesis from crossed rewrite systems
Conditional and Typed Rewriting Systems | 2023-03-09 | Paper |
On proving properties of completion strategies
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Chain properties of rule closures
STACS 89 | 2022-08-16 | Paper |
| MCP: capturing big data by satisfiability (tool description) | 2022-03-22 | Paper |
The complexity of counting problems in equational matching
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
Minimal distance of propositional models
Theory of Computing Systems | 2019-09-05 | Paper |
Unification algorithms cannot be combined in polynomial time
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
The next whisky bar
Computer Science – Theory and Applications | 2016-07-25 | Paper |
As Close as It Gets
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Give me another one!
Algorithms and Computation | 2016-01-11 | Paper |
Complexity of existential positive first-order logic
Journal of Logic and Computation | 2013-08-27 | Paper |
Counting partitions of graphs
Algorithms and Computation | 2013-03-21 | Paper |
Trichotomies in the complexity of minimal inference
Theory of Computing Systems | 2012-12-06 | Paper |
Counting complexity of propositional abduction
Journal of Computer and System Sciences | 2010-08-18 | Paper |
Complexity of existential positive first-order logic
Lecture Notes in Computer Science | 2010-07-28 | Paper |
Computational complexity of simultaneous elementary matching problems
Lecture Notes in Computer Science | 2010-06-17 | Paper |
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics | 2010-04-27 | Paper |
On the counting complexity of propositional circumscription
Information Processing Letters | 2010-04-19 | Paper |
Complexity of counting the optimal solutions
Theoretical Computer Science | 2009-09-10 | Paper |
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
SIAM Journal on Computing | 2009-06-22 | Paper |
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
Logics in Artificial Intelligence | 2008-10-27 | Paper |
On Boolean primitive positive clones
Discrete Mathematics | 2008-07-11 | Paper |
Complexity of Counting the Optimal Solutions
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Complexity of clausal constraints over chains
Theory of Computing Systems | 2008-04-03 | Paper |
On the Complexity of Computing Generators of Closed Sets
Formal Concept Analysis | 2008-03-04 | Paper |
Complexity of Default Logic on Generalized Conjunctive Queries
Logic Programming and Nonmonotonic Reasoning | 2007-11-13 | Paper |
Automated Reasoning
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 1962835 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1418330 (Why is no real title available?) | 2003-05-19 | Paper |
Unification algorithms cannot be combined in polynomial time.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759419 (Why is no real title available?) | 2002-11-04 | Paper |
On the complexity of recognizing the Hilbert basis of a linear Diophantine system
Theoretical Computer Science | 2002-03-03 | Paper |
Computational complexity of simultaneous elementary matching problems
Journal of Automated Reasoning | 2000-05-17 | Paper |
| scientific article; zbMATH DE number 1300970 (Why is no real title available?) | 1999-07-29 | Paper |
| scientific article; zbMATH DE number 1405441 (Why is no real title available?) | 1999-01-01 | Paper |
Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science | 1998-07-23 | Paper |
Complexity of generalized satisfiability counting problems
Information and Computation | 1997-01-02 | Paper |
The complexity of counting problems in equational matching
Journal of Symbolic Computation | 1996-08-13 | Paper |
Chain properties of rule closures
Formal Aspects of Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 3956435 (Why is no real title available?) | 1986-01-01 | Paper |
