Vai al contenuto principale della pagina
| Titolo: |
Artificial Intelligence and Symbolic Computation [[electronic resource] ] : 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings / / edited by Jaques Calmet, Tetsuo Ida, Dongming Wang
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (XIII, 269 p.) |
| Disciplina: | 006.3 |
| Soggetto topico: | Artificial intelligence |
| Computer science—Mathematics | |
| Numerical analysis | |
| Mathematical logic | |
| Artificial Intelligence | |
| Symbolic and Algebraic Manipulation | |
| Numeric Computing | |
| Discrete Mathematics in Computer Science | |
| Mathematical Logic and Formal Languages | |
| Persona (resp. second.): | CalmetJaques |
| IdaTetsuo | |
| WangDongming | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | Invited Presentations -- Interactive Mathematical Documents -- Algebra and Geometry -- An Inductive Inference System and Its Rationality -- Semantic Guidance for Saturation Provers -- Contributed Papers -- Labeled @-Calculus: Formalism for Time-Concerned Human Factors -- Enhanced Theorem Reuse by Partial Theory Inclusions -- Extension of First-Order Theories into Trees -- The Confluence Problem for Flat TRSs -- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer -- A New Definition for Passivity and Its Relation to Coherence -- A Full System of Invariants for Third-Order Linear Partial Differential Operators -- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial -- Quantifier Elimination for Quartics -- On the Mixed Cayley-Sylvester Resultant Matrix -- Implicitization of Rational Curves -- Operator Calculus Approach to Solving Analytic Systems -- Solving Dynamic Geometric Constraints Involving Inequalities -- Constraints for Continuous Reachability in the Verification of Hybrid Systems -- Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances -- Finding Relations Among Linear Constraints -- A Search Engine for Mathematical Formulae -- Hierarchical Representations with Signatures for Large Expression Management. |
| Titolo autorizzato: | Artificial Intelligence and Symbolic Computation ![]() |
| ISBN: | 3-540-39730-2 |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466152003316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |