| Type of document: |
 |
Peer-reviewed conferences/proceedings |
|
| Domain: |
|
Computer Science/Logic in Computer Science
|
|
| Title: |
|
Clausal Presentation of Theories in Deduction Modulo |
|
| Author(s): |
|
Jianhua Gao 1, 2 |
|
| Research team(s): |
|
|
|
| Abstract: |
|
Resolution modulo is an extension of first-order resolution where axioms are replaced by rewrite rules, used to rewrite, or more generally narrow, clauses during the search. In the first version of this method, clauses were rewritten to arbitrary propositions, that needed to be dynamically transformed into clauses. This unpleasant feature can be eliminated when the rewrite system is clausal, i.e. when it transforms clauses to clauses. We show in this paper that how to transform any rewrite system into a clausal one, preserving the existence of cut free proof of any sequent. |
|
| Full text language: |
|
English |
|
|
| Publication date: |
|
2011 |
|
| Audience: |
|
international |
|
| Conference title: |
|
PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories |
|
| Conference city: |
|
Wroclaw |
|
| Country: |
|
Poland |
|
| Conference date: |
|
2011-08-01 |
|
| Organizer: |
|
Germain Faure, Stéphane Lengrand, Assia Mahboubi |
|
|
BibTeX,EndNote,...
