Logique propositionnelle And NotDominique Larchey-Wendling
List of bibliographic references
Number of relevant bibliographic references: 16.Ident. | Authors (with country if any) | Title |
---|---|---|
000017 | Hans Van Ditmarsch [France] ; Sujata Ghosh [Inde] ; Rineke Verbrugge [Pays-Bas] ; YANJING WANG [République populaire de Chine] | Hidden protocols: Modifying our expectations in an evolving world |
000081 | Didier Galmiche [France] ; Daniel Mery [France] | A Connection-based Characterization of Bi-intuitionistic Validity |
000385 | Pascal Fontaine [France] ; Jean-Yves Marion [France] ; Stephan Merz [France] ; Leonor Prensa Nieto [France] ; Alwen Tiu [France] | Expressiveness + automation + soundness : Towards combining SMT solvers and interactive proof assistants |
000476 | Francois Lamarche [France] ; Lutz Strassburger [Allemagne] | Naming proofs in classical propositional logic |
000500 | Marco Bozzano [Italie] ; Roberto Bruttomesso [Italie] ; Alessandro Cimatti [Italie] ; Tommi Junttila [Finlande] ; Silvio Ranise [France] ; Peter Van Rossum [Pays-Bas] ; Roberto Sebastiani [Italie] | Efficient satisfiability modulo theories via delayed theory combination |
000818 | Didier Galmiche [France] ; Daniel Mery [France] | Connection-based proof search in propositional BI logic |
000880 | Philippe De Groote [France] | Strong normalization of classical natural deduction with disjunction |
000886 | D. Larchey-Wendling [France] ; D. Mery [France] ; Didier Galmiche [France] | STRIP : Structural sharing for efficient proof-search |
000890 | Didier Galmiche [France] ; Daniel Mery [France] | Proof-search and countermodel generation in propositional BI logic |
000994 | A. Bockmayr [France] ; Y. Dimopoulos [Chypre (pays)] | Integer programs and valid inequalities for planning problems |
000A66 | D. Galmiche [France] ; D. Larchey-Wendling [France] | Structural sharing and efficient proof-search in propositional intuitionistic logic |
000A69 | P. De Groote [France] | On the strong normalisation of natural deduction with permutation-conversions |
000A83 | J.-Y. Marion [France] | From multiple sequent for additive linear logic to decision procedures for free lattices |
000A90 | L. Juban [France] | Dichotomy theorem for the generalized unique satisfiability problem |
000C13 | S. Malecki [France] | Proofs in system Fω can be done in system Fω 1 |
000C38 | J.-Y. Marion [France] | Case study : Additive linear logic and lattices |
This area was generated with Dilib version V0.6.33. |