Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules.
Mnacho EchenimRadu IosifNicolas PeltierPublished in: Inf. Process. Lett. (2022)
Keyphrases
- logic programming
- np complete
- logical rules
- rule learning
- data structure
- symbolic knowledge
- probabilistic logic
- deductive reasoning
- association rules
- linear temporal logic
- sufficient conditions
- inductive learning
- symbolic representation
- classical logic
- rule engine
- knowledge representation
- active rules
- cut elimination
- production rules
- decision rules
- association rule mining
- intuitionistic logic
- high level
- derivation rules
- proof theoretic
- neural network
- functional programs
- textual entailment
- automated reasoning
- logic programs
- description logics