STACS 2005

DOI10.1007/B106485zbMath1119.68096OpenAlexW4230940848MaRDI QIDQ5710723

Manuel Bodirsky

Publication date: 2 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Categoricity and completeness of theories (03C35)

Related Items (6)

A counterexample to the reconstruction of \(\omega\)-categorical structures from their endomorphism monoid ⋮ Preserving Constraints with the Stable Chase ⋮ Permutation monoids and MB-homogeneity for graphs and relational structures ⋮ Two Fraïssé-style theorems for homomorphism-homogeneous relational structures ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Description logics with concrete domains and general concept inclusions revisited

This page was built for publication: STACS 2005