|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465909703316 |
|
|
Titolo |
Logic for Programming and Automated Reasoning [[electronic resource] ] : 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings / / edited by Michel Parigot, Andrei Voronkov |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2000.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 490 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 1955 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematical logic |
Programming languages (Electronic computers) |
Artificial intelligence |
Computer logic |
Mathematical Logic and Foundations |
Programming Languages, Compilers, Interpreters |
Artificial Intelligence |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Nonmononic reasoning -- On the Complexity of Theory Curbing -- Descriptive complexity -- Graph Operations and Monadic Second-Order Logic: A Survey -- Efficient First Order Functional Program Interpreter with Time Bound Certifications -- Specification and automatic proof-assistants -- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System -- Behavioural Constructor Implementation for Regular Algebras -- An Extensible Proof Text Editor -- A Tactic Language for the System Coq -- Theorem proving -- Proof Simplification for Model Generation and Its Applications -- Have SPASS with OCC1N = g -- Verification -- Compiling and Verifying Security Protocols -- Equational Binary Decision Diagrams -- A PVS Proof |
|
|
|
|