Abstract
AbstractClassical propositional logic plays a prominent role in industrial applications, and yet the complexity of this logic is presumed to be non-feasible. Tractable systems such as depth-bounded boolean logics approximate classical logic and can be seen as a model for resource-bounded agents whose reasoning style is nonetheless classical. In this paper we first study a hierarchy of tractable logics that is not defined by depth. Then we extend it into a modal logic where modalities make explicit the assumptions discharged in propositional proofs, thereby expressing blueprints for proofs. A natural deduction system is provided that permits to reason about and manage such proof blueprints.
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference46 articles.
1. Ågotnes, T., and M. Walicki, A logic of reasoning, communication and cooperation with syntactic knowledge, in 4th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), Association for Computing Machinery, New York, 2005, pp. 1135–1136.
2. Alechina, N., B. Logan, and M. Whitsey, A complete and decidable logic for resourcebounded agents, in Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems: Volume 2 (AAMAS 2004), IEEE Computer Society, New York, 2004, pp. 606–613.
3. Artemov, S.N., and E. Nogina, Introducing justification into epistemic logic, Journal of Logic and Computation 15(6):1059–1073, 2005.
4. Bendall, K., Natural deduction, separation and the meaning of logical operators, Journal of Philosophical Logic 7(1):245–276, 1978.
5. Bjerring, J.Ch., and M. Skipper, A dynamic solution to the problem of logical omniscience, Journal of Philosophical Logic 48(3):501–521, 2019.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献