Fast algorithms for revision of some special propositional knowledge bases
From MaRDI portal
Publication:1415946
DOI10.1007/BF02948909zbMATH Open1046.68104MaRDI QIDQ1415946FDOQ1415946
Authors: Shangmin Luan, Guozhong Dai 
Publication date: 9 December 2003
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Recommendations
- A practical parallel algorithm for propositional knowledge base revision
- An algebraic approach to revising propositional rule-based knowledge bases
- Propositional knowledge base revision and minimal change
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- A programmable approach to revising knowledge bases
- Knowledge Base Revision in Description Logics
- Publication:5751985
- scientific article; zbMATH DE number 4094868
- Fast algorithms for implication bases and attribute exploration using proper premises
Cites Work
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Reasoning about action. I: A possible worlds approach
- The unique Horn-satisfiability problem and quadratic Boolean equations.
- Unique satisfiability of Horn sets can be solved in nearly linear time
- Counterfactuals
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Fast algorithms for revision of some special propositional knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1415946)
