The universe of propositional approximations

DOI10.1016/j.tcs.2006.01.007zbMath1088.68162OpenAlexW2041848570MaRDI QIDQ2369011

Renata Wassermann, Marcelo Finger

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.007

zbMATH Keywords

Automated reasoningNon-classical logicsKnowledge representationApproximate reasoningDeductive systems

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35)

Related Items

Informational semantics, non-deterministic matrices and feasible deduction ⋮ A modal view on resource-bounded propositional logics ⋮ Semantics and proof-theory of depth bounded Boolean logics ⋮ An informational view of classical logic ⋮ Approximations of modal logics: \(\mathbf K\) and beyond ⋮ Does This Set of Clauses Overlap with at Least One MUS?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
• On the complexity of entailment in propositional multivalued logics
• Semantical and computational aspects of Horn approximations
• Tractable reasoning via approximation
• Approximate belief revision
• Labelled natural deduction for substructural logics
• Knowledge compilation and theory approximation
• Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
• Advances in Artificial Intelligence – SBIA 2004
• Logics in Artificial Intelligence