GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
Chandra & Philip M
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Classes of aggregators for first-order relational databases are identified that respect integrity constraints when all inputs do, along with query languages where aggregation and querying commute.
citing papers explorer
-
Guarded Negation Transitive Closure Logic
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
-
Social Choice Methods for Database Aggregation
Classes of aggregators for first-order relational databases are identified that respect integrity constraints when all inputs do, along with query languages where aggregation and querying commute.