Decidability of systems of set constraints with negative constraints

DOI10.1006/inco.1995.1139zbMath0834.68105OpenAlexW1999968383MaRDI QIDQ1900313

Alexander Aiken, Dexter Kozen, Edward L. Wimmers

Publication date: 30 October 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6132

zbMATH Keywords

set constraints

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (19)

Problems in rewriting III ⋮ Some new decidability results on positive and negative set constraints ⋮ Set Constraints, Pattern Match Analysis, and SMT ⋮ Tree Automata with Global Constraints ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Rational spaces and set constraints ⋮ Anti-patterns for rule-based languages ⋮ TREE AUTOMATA WITH GLOBAL CONSTRAINTS ⋮ Grid structures and undecidable constraint theories ⋮ Set constraints with intersection ⋮ Rational spaces and set constraints ⋮ Set constraints and logic programming ⋮ An undecidable fragment of the theory of set constraints ⋮ Set constraints in some equational theories ⋮ Set constraints and automata ⋮ Simplifying subtyping constraints: a theory ⋮ Tarskian set constraints ⋮ Set constraints and topology ⋮ The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard

This page was built for publication: Decidability of systems of set constraints with negative constraints