#### Filter Results:

- Full text PDF available (37)

#### Publication Year

2000

2016

- This year (0)
- Last five years (19)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Kaustuv Chaudhuri, Dale Miller, Alexis Saurin
- IFIP TCS
- 2008

The sequent calculus admits many proofs of the same conclusion that differ only by trivial permutations of inference rules. In order to eliminate this " bureaucracy " from sequent proofs, deductive formalisms such as proof nets or natural deduction are usually used instead of the sequent calculus, for they identify proofs more abstractly and geometrically.… (More)

Forward reasoning in the propositional fragment We shall now begin our investigation into the use of the sequent calculus for automated reasoning in various fragments of linear logic. The first fragment we pick is the proposi-can be readily extended to include possibility. We begin by examining the problem of resource non-determinism in the backward… (More)

- David Baelde, Kaustuv Chaudhuri, +4 authors Yuting Wang
- J. Formalized Reasoning
- 2014

The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive and co-inductive reasoning over relations. Abella supports the λ-tree approach to treating syntax containing binders: it allows simply typed λ-terms to be used to represent such syntax and it provides higher-order (pattern) unification, the ∇ quantifier, and… (More)

- Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur
- PPDP
- 2013

The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems that are commonly presented via syntax-directed rules that make use of contexts and side-conditions. The two-level logic approach, as implemented in the Abella theorem prover, embeds the HH specification logic within a rich reasoning logic that… (More)

- Yuting Wang, Kaustuv Chaudhuri
- TLCA
- 2015

For λ-terms constructed freely from a type signature in a type theory such as LF, there is a simple inductive subordination relation that is used to control type-formation. There is a related – but not precisely complementary – notion of independence that asserts that the inhabitants of the function space τ 1 → τ 2 depend vacuously on their arguments.… (More)

We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L ¨ of's separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing… (More)

- Kaustuv Chaudhuri, Frank Pfenning, Greg Price
- IJCAR
- 2006

The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli's focusing strategy can be adapted for the inverse method in linear logic. In this paper we introduce the notion of focusing bias for atoms and show that it gives rise to forward and backward chaining, generalizing both… (More)

- Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz
- IJCAR
- 2010

1 Overview TLAPS, the TLA + proof system, is a platform for the development and mechanical verification of TLA + proofs. The TLA + proof language is declarative, and understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of… (More)

- Kaustuv Chaudhuri, Frank Pfenning
- CSL
- 2005

Focusing is traditionally seen as a means of reducing inessential non-determinism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in the inverse method. We show that the focused inverse method… (More)

- Kaustuv Chaudhuri
- LPAR
- 2008

It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. We present a sequent calculus of synthetic connectives based on neutral proof patterns , which are a syntactic normal form for such connectives. Different focusing strategies arise from different… (More)