Search

Your search keyword '"Reis, Giselle"' showing total 6 results
Start Over Author "Reis, Giselle" Topic sequent calculus
6 results on '"Reis, Giselle"'

1. Proof Search and Certificates for Evidential Transactions

Author

Nigam, Vivek, Reis, Giselle, Rahmouni, Samar, Ruess, Harald, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Platzer, André, editor, and Sutcliffe, Geoff, editor

Published
2021
Full Text
View/download PDF

2. Sequoia: A Playground for Logicians : (System Description)

Author

Reis, Giselle, Naeem, Zan, Hashim, Mohammed, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Peltier, Nicolas, editor, and Sofronie-Stokkermans, Viorica, editor

Published
2020
Full Text
View/download PDF

3. An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials

Author

Chaudhuri, Kaustuv, Reis, Giselle, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Davis, Martin, editor, Fehnker, Ansgar, editor, McIver, Annabelle, editor, and Voronkov, Andrei, editor

Published
2015
Full Text
View/download PDF

4. The Proof Certifier Checkers

Author

Chihani, Zakaria, Libal, Tomer, Reis, Giselle, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and De Nivelle, Hans, editor

Published
2015
Full Text
View/download PDF

5. Formalized Meta-Theory of Sequent Calculi for Substructural Logics.

Author

Chaudhuri, Kaustuv, Lima, Leonardo, and Reis, Giselle

Subjects
METATHEORY, SEQUENT calculus, INTUITIONISTIC mathematics, LOGIC programming, CODING theory
Abstract

When studying sequent calculi, proof theorists often have to prove properties about the systems, whether it is to show that they are “well-behaved”, amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or two more complicated cases. Moreover, the amount of details makes them more error-prone for humans. Computers, on the other hand, are very good at handling details and repetitiveness. In this work we have formalized textbook proofs of the meta-theory of sequent calculi for linear logic in Abella. Using the infrastructure developed, the proofs can be easily adapted to other substructural logics. We implemented rules as clauses in an intuitive and straightforward way, similar to logic programming, using operations on multisets for the explicit contexts. Although the proofs are quite big, their writing took no more than a few weeks once the correct definitions were found. This is an evidence that machine-checked proofs of properties of sequent calculi can be obtained using a natural encoding on most proof assistants available nowadays. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

6. Formalized meta-theory of sequent calculi for linear logics.

Author

Chaudhuri, Kaustuv, Lima, Leonardo, and Reis, Giselle

Subjects
*CALCULI, *LOGIC, *LOGIC programming, *PROOF theory
Abstract

When studying sequent calculi, proof theorists often have to prove properties about the systems, whether to show that they are "well-behaved", amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or two more complicated cases. Moreover, the amount of details makes them more error-prone for humans. Computers, on the other hand, are very good at handling details and repetitiveness. In this work we have formalized textbook proofs of the meta-theory of sequent calculi for linear logic in Abella. Using the infrastructure developed, the proofs can be easily adapted to other substructural logics. We implemented rules as clauses in an intuitive and straightforward way, similar to logic programming, using operations on multisets for the explicit contexts. Although the proofs are quite big, they use only elementary reasoning principles, which makes the proof techniques fairly portable to other formal reasoning systems. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results