|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465375403316 |
|
|
Titolo |
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2002.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 346 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 2381 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Mathematical logic |
Software engineering |
Computer programming |
Artificial Intelligence |
Mathematical Logic and Formal Languages |
Software Engineering |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Papers -- Proof Analysis by Resolution -- Using Linear Logic to Reason about Sequent Systems -- Research Papers -- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic -- Tableaux for Quantified Hybrid Logic -- Tableau-Based Automated Deduction for Duration Calculus -- Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge -- A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic -- Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks -- Tableau Calculi for the Logics of Finite k-Ary Trees -- A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition -- Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment -- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas -- |
|
|
|
|