DeepAI AI Chat

A Note on Generic Tangle Algorithms

05/29/2020

∙

by Christian Elbracht, et al.

∙

∙

In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which outputs a certificate for the non-existence of tangles if possible, and otherwise a way to jump-start the naive tree search; and a way to obtain a tree-of-tangles.

Christian Elbracht
3 publications
Jakob Kneip
2 publications
Maximilian Teegen
3 publications

page 1

page 2

page 3

page 4

∙ 03/09/2021

On the Complexity of the CSG Tree Extraction Problem

In this short note, we discuss the complexity of the search space for th...

0 Markus Friedrich, et al. ∙

∙ 11/27/2015

A Stochastic Process Model of Classical Search

Among classical search algorithms with the same heuristic information, w...

0 Dimitri Klimenko, et al. ∙

∙ 02/19/2020

A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet

Recently, Cohen, Haeupler and Schulman gave an explicit construction of ...

0 Siddharth Bhandari, et al. ∙

∙ 12/20/2021

Concurrence for well-formed CAFs: Naive Semantics

In the area of claim-based reasoning in abstract argumentation, a claim-...

0 Rafael Kiesel, et al. ∙

∙ 05/09/2017

A note on the uniqueness of models in social abstract argumentation

Social abstract argumentation is a principled way to assign values to co...

0 Leila Amgoud, et al. ∙

∙ 03/29/2010

Searching publications on operating systems

This note concerns a search for publications in which one can find state...

0 C. A. Middelburg, et al. ∙

∙ 11/29/2021

Naive Automated Machine Learning

An essential task of Automated Machine Learning (AutoML) is the problem ...

0 Felix Mohr, et al. ∙