Adding clauses to poor man's logic (without increasing the complexity)

DOI10.3166/JANCL.15.341-357zbMATH Open1185.03030OpenAlexW2078543661MaRDI QIDQ3647233FDOQ3647233

Authors: Peter Jonsson 

Publication date: 30 November 2009

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.15.341-357

Recommendations

• scientific article; zbMATH DE number 1500520
• scientific article; zbMATH DE number 6917935
• The complexity of poor man's logic
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• On the complexity of elementary modal logics

zbMATH Keywords

computational complexitymodal logicdisjunctionpoor man's logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A unifying approach to temporal constraint reasoning
• Building tractable disjunctive constraints
• Attributive concept descriptions with complements
• A guide to completeness and complexity for modal logics of knowledge and belief
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of concept languages
• Title not available (Why is that?)
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
• The complexity of poor man's logic
• Title not available (Why is that?)

This page was built for publication: Adding clauses to poor man's logic (without increasing the complexity)

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