scientific article; zbMATH DE number 1555173

zbMath0953.68557MaRDI QIDQ4525271

Moshe Y. Vardi, F. Wimmers, Alexander Aiken, Dexter Kozen

Publication date: 22 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (19)

Some new decidability results on positive and negative set constraints ⋮ Rational spaces and set constraints ⋮ Unification and matching modulo nilpotence ⋮ Computational completeness of equations over sets of natural numbers ⋮ Checking Emptiness of Non-Deterministic Regular Types with Set Operators ⋮ Unification of concept terms in description logics ⋮ Decision problems for language equations ⋮ Unification modulo ACUI plus distributivity axioms ⋮ Deciding inclusion of set constants over infinite non-strict data structures ⋮ Set constraints with intersection ⋮ Rational spaces and set constraints ⋮ Set constraints and logic programming ⋮ Set constraints in some equational theories ⋮ Set constraints in some equational theories ⋮ Language equations ⋮ Set constraints and automata ⋮ Closure properties and decision problems of dag automata ⋮ Complexity of nilpotent unification and matching problems. ⋮ Tarskian set constraints

This page was built for publication: