Keywords
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

Index « Keywords » - entrée « Propositional logic »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Propositional language < Propositional logic < Prosody  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 17.
Ident.Authors (with country if any)Title
000017 (2014) 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 (2013) Didier Galmiche [France] ; Daniel Mery [France]A Connection-based Characterization of Bi-intuitionistic Validity
000385 (2006) 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 (2005) Francois Lamarche [France] ; Lutz Strassburger [Allemagne]Naming proofs in classical propositional logic
000500 (2005) 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 (2002) Didier Galmiche [France] ; Daniel Mery [France]Connection-based proof search in propositional BI logic
000821 (2002) Dominique Larchey-Wendling [France]Combining proof-search and counter-model construction for deciding Gödel-Dummett logic
000880 (2001) Philippe De Groote [France]Strong normalization of classical natural deduction with disjunction
000886 (2001) D. Larchey-Wendling [France] ; D. Mery [France] ; Didier Galmiche [France]STRIP : Structural sharing for efficient proof-search
000890 (2001) Didier Galmiche [France] ; Daniel Mery [France]Proof-search and countermodel generation in propositional BI logic
000994 (2000) A. Bockmayr [France] ; Y. Dimopoulos [Chypre (pays)]Integer programs and valid inequalities for planning problems
000A66 (1999) D. Galmiche [France] ; D. Larchey-Wendling [France]Structural sharing and efficient proof-search in propositional intuitionistic logic
000A69 (1999) P. De Groote [France]On the strong normalisation of natural deduction with permutation-conversions
000A83 (1999) J.-Y. Marion [France]From multiple sequent for additive linear logic to decision procedures for free lattices
000A90 (1999) L. Juban [France]Dichotomy theorem for the generalized unique satisfiability problem
000C13 (1997) S. Malecki [France]Proofs in system Fω can be done in system Fω 1
000C38 (1997) J.-Y. Marion [France]Case study : Additive linear logic and lattices

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i -k "Propositional logic" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i  \
                -Sk "Propositional logic" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Propositional logic
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022