000 04498nam a22006255i 4500
001 978-3-540-49816-2
003 DE-He213
005 20240423132431.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540498162
_9978-3-540-49816-2
024 7 _a10.1007/BFb0055897
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aArtificial Intelligence and Symbolic Computation
_h[electronic resource] :
_bInternational Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings /
_cedited by Jacques Calmet, Jan Plaza.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aXII, 316 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1476
505 0 _aAn 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.
520 _aThis 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.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aMachine theory.
650 0 _aAlgorithms.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aAlgorithms.
700 1 _aCalmet, Jacques.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPlaza, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540649601
776 0 8 _iPrinted edition:
_z9783662164518
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1476
856 4 0 _uhttps://doi.org/10.1007/BFb0055897
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187703
_d187703