Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control

DOI10.1093/logcom/14.2.179zbMath1101.68086OpenAlexW1984806351MaRDI QIDQ4820464

Marcelo Finger, Renata Wassermann

Publication date: 15 October 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/14.2.179

zbMATH Keywords

knowledge representationapproximate reasoningAutomated reasoningnon-classical logicsdeductive systemslimited reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (10)

Tractable approximate deduction for OWL ⋮ Informational semantics, non-deterministic matrices and feasible deduction ⋮ The enduring scandal of deduction. Is propositional logic really uninformative? ⋮ The universe of propositional approximations ⋮ Cut and pay ⋮ Semantics and proof-theory of depth bounded Boolean logics ⋮ An informational view of classical logic ⋮ Approximations of modal logics: \(\mathbf K\) and beyond ⋮ On AGM for non-classical logics ⋮ The Universe of Approximations

This page was built for publication: Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control