| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466124103316 |
|
|
Titolo |
Artificial Intelligence and Symbolic Computation [[electronic resource] ] : International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings / / edited by Jacques Calmet, Jan Plaza |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1998.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 316 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 1476 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Computers |
Computer science—Mathematics |
Mathematical logic |
Algorithms |
Artificial Intelligence |
Theory of Computation |
Symbolic and Algebraic Manipulation |
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 contenuto |
|
An inductive logic programming query language for database mining -- Bertrand Russell, Herbrand’s theorem, and the assignment statement -- Representing and reasoning with context -- From integrated reasoning specialists to “plug-and-play? reasoning components -- Reasoning about coding theory: The benefits we get from computer algebra -- Automatic generation of epsilon-delta proofs of continuity -- Finite model search for equational theories (FMSET) -- Specification and integration of theorem provers and computer algebra systems -- COLETTE, prototyping CSP solvers using a rule-based language -- An evolutionary algorithm for welding task sequence ordering -- Intuitionistic proof transformations and their application to constructive program synthesis -- Combining algebraic computing and term- |
|
|
|
|
|
|
|
|
|
|
|
rewriting for geometry theorem proving -- Cooperation between top-down and bottom-up theorem provers by subgoal clause transfer -- Polymorphic call-by-value calculus based on classical proofs -- Inference and verification in Medical Appropriateness Criteria using Gröbner Bases -- The unification problem for one relation Thue Systems -- Basic Completion with E-cycle Simplification -- SoleX: A domain-independent scheme for constraint solver extension -- Optimising propositional modal satisfiability for description logic subsumption -- Instantiation of existentially quantified variables in inductive specification proofs -- Knowledge discovery objects and queries in Distributed Knowledge Systems -- ALLTYPES: An algebraic language and TYPE system -- Real parametrization of algebraic curves -- Non-clausal reasoning with propositional definite theories. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the International Conference on Artificial Intelligence and Symbolic Computation, AISC'98, held in Plattsburgh, NY, in September 1998. The 24 revised full papers presented were carefully selected for inclusion in the book. The papers address various aspects of symbolic computation and formal reasoning such as inductive logic programming, context reasoning, computer algebra, proof theory and theorem proving, term rewriting, algebraic manipulation, formal verification, constraint solving, and knowledge discovery. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996466152003316 |
|
|
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 |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIII, 269 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 4120 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
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 |
|
|
|
|
|
|
|
|
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 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. |
|
|
|
|
|
| |