activity
20152021
most citedEfficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.LO2016

From -Calculus to Alternating Tree Automata using Parity Games

M. Fareed Arif

-Calculus and automata on infinite trees are complementary ways of describing infinite tree languages. The correspondence between -Calculus and alternating tree automaton is…