Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard.
Mnacho EchenimRadu IosifNicolas PeltierPublished in: CoRR (2020)
Keyphrases
- logic based argumentation
- logic programming
- upper bound
- deductive reasoning
- probabilistic logic
- description logics
- logic programs
- knowledge representation
- inductive logic programming
- classical logic
- machine learning
- tableau calculus
- artificial intelligence
- fixed point semantics
- automata theoretic
- inductive learning
- decision problems
- functional programs
- logical framework
- multi valued
- valued logic
- inductive inference
- first order logic
- lower bound