NEXP-Completeness and Universal Hardness Results for Justification Logic.
Antonis AchilleosPublished in: CSR (2015)
Keyphrases
- multi valued
- data sets
- logic programming
- computational properties
- computational complexity
- modal logic
- learning theory
- predicate logic
- automated reasoning
- asynchronous circuits
- defeasible logic
- classical logic
- proof theory
- set theory
- information theoretic
- dynamic environments
- np complete
- logic programs
- worst case
- np hard
- knowledge base