Abstract : We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into clause form. Restricting Resolution modulo in this way requires to extend it in another and distinguish the rules that apply to negative and positive atomic propositions. This method can be seen as a restriction of Equational resolution that mixes clause selection and literal selection restrictions. Unlike many restrictions of Resolution, it is not an instance of Ordered resolution.
Type de document :
Communication dans un congrès
Cristian S. Calude; Vladimiro Sassone. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. Springer, IFIP Advances in Information and Communication Technology, AICT-323, pp.182-196, 2010, Theoretical Computer Science. 〈10.1007/978-3-642-15240-5_14〉
https://hal.inria.fr/hal-01054460
Contributeur : Hal Ifip
<>
Soumis le : mercredi 6 août 2014 - 16:25:53
Dernière modification le : mercredi 13 mars 2019 - 16:58:01
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 01:01:07
Gilles Dowek. Polarized Resolution Modulo. Cristian S. Calude; Vladimiro Sassone. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. Springer, IFIP Advances in Information and Communication Technology, AICT-323, pp.182-196, 2010, Theoretical Computer Science. 〈10.1007/978-3-642-15240-5_14〉. 〈hal-01054460〉
