Journal of symbolic computation

• 

  Año 2010, Vol. 45, Número 2

  • Special issue on automated deduction: decidability, complexity, tractability

    Silvio Ghilardi, Viorica Sofronie Stokkermans, Ulrike Sattler, Ashish Tiwari

    págs. 151-152

    

  • Decidable fragments of many-sorted logic

    Aharon Abadi, Alexander Rabinovich, Mooly Sagiv

    • Resumen

    págs. 153-172

    

  • Context unification with one context variable

    Adrià Gascón, Guillem Godoy Balil, Manfred Schmidt Schauss, Ashish Tiwari

    • Resumen

    págs. 173-193

    

  • Deciding inseparability and conservative extensions in the description logic EL

    Carsten Lutz, Frank Wolter

    • Resumen

    págs. 194-228

    

  • Theory decision by decomposition

    Maria Paola Bonacina, Mnacho Echenim

    • Resumen

    págs. 229-260

    

  • Combination of convex theories: modularity, deduction completeness, and explanation

    Duc-Khanh Tran, Christophe Ringeissen, Silvio Ranise, Hélène Kirchner

    • Resumen

    págs. 261-286