Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard.

Mnacho Echenim Radu Iosif Nicolas Peltier

Published in: LPAR (2020)

Keyphrases

multi valued
logic based argumentation
description logics
upper bound
logic programming
knowledge representation
first order logic
machine learning
np complete
inductive logic programming
inductive learning
tree automata
artificial intelligence
knowledge base
logic programs
textual entailment