Login / Signup
On the Complexity of Perfect Models of Logic Programs.
Sergey M. Dudakov
Published in:
Fundam. Informaticae (1999)
Keyphrases
</>
logic programs
logic programming
answer sets
fixpoint
background knowledge
answer set programming
semantics for logic programs
stable models
normal logic programs
term rewriting systems
prolog programs
monotonicity constraints
computational properties
strong equivalence
functional programs
existentially quantified
machine learning
logic program updates
abductive reasoning
accurate models
horn clauses
inductive logic programming
computational complexity
high level
artificial intelligence