Artificial intelligence and symbolic computation : International Conference AISC 98, Plattsburg, New York, USA, September 16 18, 1998 : proceedings
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 var...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science. Lecture notes in artificial intelligence
1476 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Artificial intelligence and symbolic computation, International Conference, AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, proceedings, Jacques Calmet, Jan Plaza (eds.), 1998, New York, Springer, 1 vol. (XI-307 p.), Lecture notes in computer science, 3-540-64960-3 • Artificial Intelligence and Symbolic Computation, Texte imprimé, 9783662164518 |
Inhaltsangabe:
- 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.