scientific article; zbMATH DE number 1555173
From MaRDI portal
Publication:4525271
Recommendations
Cited in
(26)- Some new decidability results on positive and negative set constraints
- Unification and matching modulo nilpotence
- Set constraints and automata
- Set constraints and logic programming
- Deciding inclusion of set constants over infinite non-strict data structures
- Complexity of nilpotent unification and matching problems.
- Set constraints with intersection
- The complexity of problems for quantified constraints
- scientific article; zbMATH DE number 5547861 (Why is no real title available?)
- Unification of concept terms in description logics
- Language equations
- Closure properties and decision problems of dag automata
- Computational completeness of equations over sets of natural numbers
- Rational spaces and set constraints
- Rational spaces and set constraints
- Decidability of systems of set constraints with negative constraints
- Complexity of clausal constraints over chains
- Unification modulo ACUI plus distributivity axioms
- Checking Emptiness of Non-Deterministic Regular Types with Set Operators
- The Computational Complexity of Choice Sets
- Decision problems for language equations
- A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
- Tarskian set constraints
- Set constraints in some equational theories
- An undecidable fragment of the theory of set constraints
- Set constraints in some equational theories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525271)
