Pages that link to "Item:Q293360"
From MaRDI portal
The following pages link to On the complexity of Boolean unification (Q293360):
Displaying 15 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Lost in translation: language independence in propositional logic -- application to belief change (Q490446) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Embedding Boolean expressions into logic programming (Q1100935) (← links)
- Unification in Boolean rings (Q1112626) (← links)
- Finitariness of elementary unification in Boolean region connection calculus (Q1687563) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Boolean unification with predicates (Q2987044) (← links)
- On complexity of the anti-unification problem (Q3184519) (← links)
- Contact Logic is Finitary for Unification with Constants (Q3298276) (← links)
- Towards Parallel Boolean Functional Synthesis (Q3303903) (← links)
- (Q3973133) (← links)