Complexity classification of truth maintenance systems

DOI10.1007/BFB0020813MaRDI QIDQ4035685zbMATH OpenFDO

Authors Vladislav Rutenburg

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020813

zbMATH Keywords

completenesstruth maintenance systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Recommendations

• Propositional truth maintenance systems: Classification and complexity analysis
• scientific article; zbMATH DE number 67479
• scientific article; zbMATH DE number 17802
• Structure-driven algorithms for truth maintenance
• A rational reconstruction of nonmonotonic truth maintenance systems

Cited in

(7)

• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Truth maintenance systems. ECAI '90 Workshop, Stockholm, Sweden, August 6, 1990. Proceedings
• The maximum clique interdiction problem
• Propositional truth maintenance systems: Classification and complexity analysis
• scientific article; zbMATH DE number 4162293 (Why is no real title available?)
• scientific article; zbMATH DE number 124280 (Why is no real title available?)
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)

This page was built for publication: Complexity classification of truth maintenance systems

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