scientific article; zbMATH DE number 2084427

MaRDI QIDQ4475200zbMATH OpenFDO

Authors Yan Zhang

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2256/22560631.htm

Mathematics Subject Classification ID

Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Logic program-based updates
• scientific article; zbMATH DE number 1453062
• Dynamic updates of non-monotonic knowledge bases
• Knowledge updates: Semantics and complexity issues
• scientific article; zbMATH DE number 1708075

Cited in

(10)

• Mind change complexity of learning logic programs
• Weak updates and separation logic
• Knowledge updates: Semantics and complexity issues
• scientific article; zbMATH DE number 1708075 (Why is no real title available?)
• The complexity of revising logic programs
• Enhancing the expressive power of the U-Datalog language
• scientific article; zbMATH DE number 1453063 (Why is no real title available?)
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Logic program-based updates
• Logics in Artificial Intelligence

This page was built for publication:

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