Characterization Theorems for Revision of Logic Programs
From MaRDI portal
Publication:2851279
DOI10.1007/978-3-642-40564-8_48zbMATH Open1407.68477OpenAlexW271695863MaRDI QIDQ2851279FDOQ2851279
Katsumi Inoue, Nicolas Schwind
Publication date: 10 October 2013
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_48
Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17) Logic in artificial intelligence (68T27)
Cited In (3)
Recommendations
- Characterization of logic program revision as an extension of propositional revision π π
- The complexity of revising logic programs π π
- Title not available (Why is that?) π π
- Rewriting Techniques and Applications π π
- Title not available (Why is that?) π π
- A program-level approach to revising logic programs under the answer set semantics π π
- Embedding revision programs in logic programming situation calculus π π
- A Verification Logic for Rewriting Logic π π
This page was built for publication: Characterization Theorems for Revision of Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851279)