Sciweavers

107 search results - page 5 / 22
» Implementing the Meta-Theory of Deductive Systems
Sort
View
JANCL
2006
100views more  JANCL 2006»
13 years 7 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be speciļ¬ed not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...
CADE
2007
Springer
14 years 7 months ago
System for Automated Deduction (SAD): A Tool for Proof Verification
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
Konstantin Verchinine, Alexander V. Lyaletski, And...
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...