scientific article; zbMATH DE number 1555173
From MaRDI portal
Publication:4525271
zbMATH Open0953.68557MaRDI QIDQ4525271FDOQ4525271
Authors: Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, F. Wimmers 
Publication date: 22 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (26)
- Unification of concept terms in description logics
- Some new decidability results on positive and negative set constraints
- Title not available (Why is that?)
- Decidability of systems of set constraints with negative constraints
- Checking Emptiness of Non-Deterministic Regular Types with Set Operators
- An undecidable fragment of the theory of set constraints
- Complexity of nilpotent unification and matching problems.
- Closure properties and decision problems of dag automata
- Tarskian set constraints
- Unification and matching modulo nilpotence
- A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
- Complexity of clausal constraints over chains
- The Computational Complexity of Choice Sets
- Decision problems for language equations
- Set constraints in some equational theories
- Set constraints and automata
- Language equations
- Computational completeness of equations over sets of natural numbers
- Deciding inclusion of set constants over infinite non-strict data structures
- Set constraints with intersection
- Unification modulo ACUI plus distributivity axioms
- Set constraints in some equational theories
- Set constraints and logic programming
- The complexity of problems for quantified constraints
- Rational spaces and set constraints
- Rational spaces and set constraints
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)
