Strong equivalence of reversible circuits is coNP-complete.
Stephen P. JordanPublished in: CoRR (2013)
Keyphrases
- strong equivalence
- conp complete
- logic programs
- np complete
- data exchange
- decision problems
- stable models
- answer set programming
- conjunctive queries
- data complexity
- autoepistemic logic
- answer sets
- argumentation frameworks
- reasoning tasks
- sufficient conditions
- logic programming
- argumentation semantics
- expressive power
- classical logic
- query answering
- fixpoint
- database
- data integration
- desirable properties
- probability distribution
- query language
- np hard
- query processing
- computational complexity