Adding clauses to poor man's logic (without increasing the complexity)
From MaRDI portal
Publication:3647233
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1882046 (Why is no real title available?)
- scientific article; zbMATH DE number 3339381 (Why is no real title available?)
- A guide to completeness and complexity for modal logics of knowledge and belief
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A unifying approach to temporal constraint reasoning
- Attributive concept descriptions with complements
- Building tractable disjunctive constraints
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The complexity of concept languages
- The complexity of poor man's logic
- 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
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)