scientific article; zbMATH DE number 1140683
From MaRDI portal
Publication:4385449
zbMath0894.68032MaRDI QIDQ4385449
Publication date: 13 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages ⋮ Knowledge-based proof planning ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Set constraints and logic programming
This page was built for publication: