0885-6125 < 0890-5401 < 0893-6080

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f

List of bibliographic references

Number of relevant bibliographic references: 21.
[0-20] [0 - 20][0 - 21][20-20][20-40]

Ident.	Authors (with country if any)	Title
000122 (2011)	Didier Galmiche [France] ; Yakoub Salhi [France]	Sequent calculi and decidability for intuitionistic hybrid logic
000138 (2011)	Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie]	Automatic decidability and combinability
000170 (2010)	Guillaume Burel [France] ; Claude Kirchner [France]	Regaining cut admissibility in deduction modulo using abstract completion
000251 (2009)	Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France]	Computationally sound implementations of equational theories against passive adversaries
000280 (2008)	Yannick Chevalier [France] ; Michael Rusinowitch [France]	Hierarchical combination of intruder theories
000331 (2006)		Combining logical systems
000369 (2006)	Harald Ganzinger [Allemagne] ; Viorica Sofronie-Stokkermans [Allemagne] ; Uwe Waldmann [Allemagne]	Modular proof systems for partial functions with Evans equality
000376 (2006)	Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France]	Implicit complexity over an arbitrary structure : Quantifier alternations
000388 (2006)	Marco Bozzano [Italie] ; Roberto Bruttomesso [Italie] ; Alessandro Cimatti [Italie] ; Tommi Junttila [Finlande] ; Silvio Ranise [France] ; Peter Van Rossum [Pays-Bas] ; Roberto Sebastiani [Italie]	Efficient theory combination via boolean search
000395 (2006)	TING ZHANG [États-Unis] ; Henny B. Sipma [États-Unis] ; Zohar Manna [États-Unis]	Decision procedures for term algebras with integer constraints
000407 (2006)	JIA MENG [États-Unis] ; Claire Quigley [États-Unis] ; Lawrence C. Paulson [États-Unis]	Automation for interactive proof : First prototype
000417 (2006)	Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis]	A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
000723 (2003)	J. Y. Marion [France]	Analysing the implicit complexity of programs
000732 (2003)	Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France]	A rewriting approach to satisfiability procedures
000786 (2002)	Philippe De Groote [France]	On the strong normalisation of intuitionistic natural deduction with permutation-conversions
000959 (2000)	Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]	Unification algorithms cannot be combined in polynomial time
000995 (2000)	G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France]	Higher order unification via explicit substitutions
000B49 (1998)	C. Lynch [France]	Local simplification
000C97 (1996)	N. Creignou [France] ; M. Hermann [France]	Complexity of generalized satisfiability counting problems
000D00 (1996)	C. Ringeissen [France]	Combining decision algorithms for matching in the union of disjoint equational theories
000D33 (1995)	R. M. Amadio [France]	A quick construction of a retraction of all retractions for stable bifinites

---

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/ISSN.i -k "0890-5401" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/ISSN.i  \
                -Sk "0890-5401" \
         | 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=    ISSN.i
   |clé=    0890-5401
}}

---

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