Fast algorithms for revision of some special propositional knowledge bases

DOI10.1007/BF02948909zbMath1046.68104MaRDI QIDQ1415946

Guozhong Dai, Shangmin Luan

Publication date: 9 December 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

computational complexitypropositional base revision

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (1)

An algebraic approach to revising propositional rule-based knowledge bases

Cites Work

• Reasoning about action. I: A possible worlds approach
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• The unique Horn-satisfiability problem and quadratic Boolean equations.
• Unique satisfiability of Horn sets can be solved in nearly linear time
• The complexity of theorem-proving procedures
• Counterfactuals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms for revision of some special propositional knowledge bases