Resolution for Constrained Pseudo-Propositional Logic
Abstract: This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints symbols into the alphabet of propositional logic and adjusting the underling language accordingly. Unlike the construction of CNF formulas which are restricted to a finite set of clauses, the extended CPPL does not require the corresponding set to be finite. Although this restriction is made dispensable, this work presents a constructive proof showing that the generalized resolution for CPPL is sound and complete. As a marginal result, this implies that propositional resolution is also sound and complete for formulas with even infinite set of clauses.
- In: Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013, 11-12 July 2013, Leavenworth, Washington, USA. (2013). URL http://www.aaai.org/ocs/index.php/SARA/SARA13/paper/view/7212
- Azizi-Sultan, A.: Pseudo-propositional logic. In: Proceedings of the 3rd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2018) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2018), Oxford, UK, July 18, 2018., pp. 26–33 (2018). URL http://ceur-ws.org/Vol-2095/paper1.pdf
- Azizi-Sultan, A.: Constrained pseudo-propositional logic. Logica Universalis 14(4), 523–535 (2020). 10.1007/s11787-020-00266-x. URL https://doi.org/10.1007/s11787-020-00266-x
- In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 181–194 (2009). 10.1007/978-3-642-02777-2_19. URL https://doi.org/10.1007/978-3-642-02777-2_19
- In: Proceedings of the 36th Annual ACM/IEEE Design Automation Conference, DAC ’99, pp. 317–320. ACM, New York, NY, USA (1999). 10.1145/309847.309942. URL http://doi.acm.org/10.1145/309847.309942
- In: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, TACAS ’99, pp. 193–207. Springer-Verlag, London, UK, UK (1999). URL http://dl.acm.org/citation.cfm?id=646483.691738
- Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA, pp. 151–158 (1971). 10.1145/800157.805047. URL http://doi.acm.org/10.1145/800157.805047
- In: Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pittsburgh, Pennsylvania, USA, 1998, pp. 208–213 (1998). URL http://www.aaai.org/Library/AIPS/1998/aips98-025.php
- In: Proceedings of the Thirteenth National Conference on Artificial Intelligence - Volume 2, AAAI’96, pp. 1194–1201. AAAI Press (1996). URL http://dl.acm.org/citation.cfm?id=1864519.1864564
- Springer-Verlag, New York (1993)
- Prentice Hall series in artificial intelligence. Prentice Hall (2003). URL http://www.worldcat.org/oclc/314283679
- Journal of Symbolic Computation 35(2), 73 – 106 (2003). https://doi.org/10.1016/S0747-7171(02)00091-3. URL http://www.sciencedirect.com/science/article/pii/S0747717102000913
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
