Pages that link to "Item:Q4933305"

The following pages link to On the Complexity of the Bernays-Schönfinkel Class with Datalog (Q4933305):

Displaying 3 items.

• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
• An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
• Two-Variable Logic with Counting and Trees (Q5278191) (← links)