skip to main content
Idioma:
Tipo de recurso Mostra resultados com: Mostra resultados com: Índice

Automated deduction in classical and non-classical logics selected papers

Ricardo Caferra 1945-; Gernot Salzer 1963-

Berlin Springer New York c2000

Localização: ICMC - Inst. Ciên. Mat. Computação    (68-02 LNAI v.1761 e.1 ) e outros locais(Acessar)

  • Título:
    Automated deduction in classical and non-classical logics selected papers
  • Autor: Ricardo Caferra 1945-; Gernot Salzer 1963-
  • Assuntos: Automatic theorem proving; Logic, Symbolic and mathematical; LÓGICA MATEMÁTICA; INTELIGÊNCIA ARTIFICIAL
  • Notas: Includes bibliographical references and index
  • Descrição: Automated theorem proving in first-order logic modulo : on the difference between type theory and set theory / Gilles Dowek -- Higher-order modal logic--a sketch / Melvin Fitting -- Proving associative-commutative termination u sing RPO-compatibleorderings / Deepak Kapur, G. Sivakumar -- Decision procedures and model building, or how to improve logical information in automated deduction / Alexander Leitsch -- Replacement rules with definition detectio n / David A. Plaisted, Yunshan Zhu --On the comlexity [sic] of finite sorted algebras / Thierry Boy de la Tour -- A further and effective liberalization of the [delta]-rule in free variable sematic tableaux / Domenico Cantone, Marianna Nicolosi Asmundo -- A new fast tableau-baseddecision procedure for an unquantified fragment of set theory / Domenico Cantone, Calogero G. Zarba -- Interpretation of a Mizar-like logic in first-order logic / Ingo Dahn - - An O((n¨log n)p3s)-time transformation from Grz into decidablefragments of classical first-order logic / Stéphane Demri, Rajeev Goré -- Implicational completeness of signed resolution / Christian G. Fermüller -- An equation al re-engineering of set theories / Andrea Fromisano, Eugenio Omodeo -- Issues ofdecidability for description logics in the framework of resolution / Ullrich Hustadt, Renate A. Schmidt -- Extending decidable clause classes via constraints / Reinhard Pichler -- Completeness and redundancy in constrained clause logic /Reinhard
    Pichler -- Effective properties of some first-order intuitionistic modal logics / Aida Pliuéskeviéciençe -- Hidden congruent de duction / Grigore Ro÷su, Joseph Goguen -- Resolution-based theorem proving for SH[subscript n]-logics /Viorica Sofronie-Stokkermans -- Full first-order sequent and tableau calculi with preservation of solutions and the liberali zed [delta]-rule but without skolemization / Claus-Peter Wirth
  • Títulos relacionados: Série:Lecture notes in computer science Lecture notes in artificial intelligence; Lecture notes in computer science 1761
  • Editor: Berlin Springer New York
  • Data de criação/publicação: c2000
  • Formato: viii, 297 p. ill. 24 cm.
  • Idioma: Inglês
Links
Voltar para lista de resultados
Ir para página anteriorAnterior Resultado  4 AvançarIr para próxima página

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.