International audienceDeduction modulo is a formalism introduced to separate cleanly computations and deductions by reasoning modulo a congruence on propositions. A sequent calculus modulo has been defined by Dowek, Hardin and Kirchner as well as a resolution-based proof search method called Extended Narrowing And Resolution (ENAR), in which the congruences are handled through rewrite rules on terms and atomic propositions.We define a tableau-based proof search method, called Tableau Method for Deduction modulo (TaMeD), for theorem proving modulo. We then give a syntactic proof of the completeness of the method with respect to provability in the sequent calculus modulo. Moreover, we follow in our proofs the same steps as the ENAR method in ...
Abstract. We propose an extension of the tableau-based first order automated theorem prover Zenon to...
International audienceDifferent theorem provers tend to produce proof objects in different formats a...
International audienceWe propose an extension of the tableau-based first order automated theorem pro...
International audienceDeduction modulo is a way to remove computational arguments from proofs by rea...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Abstract. Deduction modulo is a theoretical framework designed to introduce computational steps in d...
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congru...
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congru...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
AbstractDeduction modulo is a way to combine computation and deduction in proofs, by applying the in...
International audienceDifferent theorem provers tend to produce proof objects in different formats a...
Abstract. We propose an extension of the tableau-based first order automated theorem prover Zenon to...
International audienceDifferent theorem provers tend to produce proof objects in different formats a...
International audienceWe propose an extension of the tableau-based first order automated theorem pro...
International audienceDeduction modulo is a way to remove computational arguments from proofs by rea...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
Abstract. Deduction modulo is a theoretical framework designed to introduce computational steps in d...
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congru...
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congru...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
AbstractDeduction modulo is a way to combine computation and deduction in proofs, by applying the in...
International audienceDifferent theorem provers tend to produce proof objects in different formats a...
Abstract. We propose an extension of the tableau-based first order automated theorem prover Zenon to...
International audienceDifferent theorem provers tend to produce proof objects in different formats a...
International audienceWe propose an extension of the tableau-based first order automated theorem pro...