The complexity of revising logic programs

DOI10.1016/S0743-1066(99)00021-7zbMATH Open0937.68024MaRDI QIDQ4262832FDOQ4262832

Authors Russell Greiner 

Publication date 24 February 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

inductive logic programmingrule-based program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 2084427
• Characterization Theorems for Revision of Logic Programs
• A program-level approach to revising logic programs under the answer set semantics
• Characterization of logic program revision as an extension of propositional revision
• Alternation and the computational complexity of logic programs
• Embedding revision programs in logic programming situation calculus
• Complexity and undecidability results for logic programming
• scientific article; zbMATH DE number 4103047
• Fixed-parameter complexity of semantics for logic programs

Cited in

(6)

• The complexity of theory revision
• Incremental maintenance of overgrounded logic programs with tailored simplifications
• Theoretical Aspects of Computing - ICTAC 2004
• Characterization Theorems for Revision of Logic Programs
• Mind change complexity of learning logic programs
• Theory revision with queries: Horn, read-once, and parity formulas

This page was built for publication: The complexity of revising logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262832)