Axioms vs. rewrite rules: from completeness to cut elimination

Autor:	Dowek, Gilles
Přispěvatelé:	Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)
Jazyk:	angličtina
Rok vydání:	2023
Předmět:	FOS: Computer and information sciences Computer Science - Logic in Computer Science [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] Logic in Computer Science (cs.LO)
Popis:	Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may require in particular to prove cut elimination for an extended notion of proof that combines deductions and computations. This suggests new interactions between automated theorem proving and proof theory.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8738fe16d4973a27ec0a041118c63ddb http://arxiv.org/abs/2306.00495 Zobrazit plný text záznamu