C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Expanding the Class of Polynomial Time Computable Well-Founded Semantics for Hybrid MKNF.
Spencer Killen
Wenkai Gao
Jia-Huai You
Published in:
ICLP Workshops (2023)
Keyphrases
</>
logic programming
turing machine
fixpoint
finite sets
logic programs
closed world
deductive databases
special case
recursive functions
open world
worst case
dnf formulas
polynomial size