On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).

Christoph Haase Alessio Mansutti Amaury Pouly

Published in: MFCS (2023)

Keyphrases

extended abstract
description logics
special case
first order logic
computational complexity
fuzzy sets
approximation algorithms
neural network
lower bound
worst case
theoretical framework
query answering
theory revision
relational model
np hard
database systems
learning algorithm