Jacques Calmet,
Jan Plaza
Springer Berlin Heidelberg
1998e druk, 1998
9783540649601
Artificial Intelligence and Symbolic Computation
International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings
Specificaties
Paperback, 316 blz.
|
Engels
Springer Berlin Heidelberg |
1998e druk, 1998
ISBN13: 9783540649601
Rubricering
Onderdeel van serie
Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540649601
Taal:Engels
Bindwijze:paperback
Aantal pagina's:316
Uitgever:Springer Berlin Heidelberg
Druk:1998
Hoofdrubriek:Automatisering algemeen, Computer en informatica
Inhoudsopgave
Contents
Invited Talks
An Inductive Logic Programming Query Language for Database Mining (Extended Abstract)
Luc De Raedt
Bertrand Russell, Herbrands theorem, and the assignment statement
Melvin Fitting
Representing and Reasoning with Context
Richmond H. Thomason
Regular Talks
From Integrated Reasoning to lug-and-Play' Reasoning Components
Alessandro Armando, Silvio Ranise
Reasoning about Coding Theory: The Benefits We Get from Computer Algebra
Clemens Ballarin, Lawrence C. Paulson
Automatic Generation of Epsilon-Delta Proofs of Continuity
Michael Beeson
Finite Model Search for Equational Theories (FMSET)
Belaid Benhamou, Laurent Heocque
Specification and Integration of Theorem Provers and Computer Algebra Systems
P.G.Bertoli, J.Calmet, F. Giunchiglia, K.Homann
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language Carlos Castro
An Evolutionary Algorithm for Welding Task Sequence Ordering
Martin Damsbo, Peder Thusgaard Ruhoff
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis
Uwe Egli, Stephan Schmitt
Combining Algebraic Computing and Term-Rewriting for Geometry Theorem Proving
Stéphane Fèvre, Dongming Wang
Cooperation between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
Dirk Fuchs
Polymorphic Call-by-Value Calculus based on Classical Proofs (Extended Abstract)
Ken-etsu Fujita
Inference and Verification in Medical Appropriateness Criteria using Grobner Bases
L.M. Laita, E. Roanes-Lozano, V. Maojo
The Unification Problem for One Relation Thue Systems
Christopher Lynch
Basic Completion with E-cycle Simplification
Christopher Lynch, Christelle Scharff
SoleX: a Domain-Independent Scheme for Constraint Solver Extension
Eric Monfroy, Christophe Ringeissen
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Ian Horrocks, Peter F.Patel-Schneider
Instantiation of Existentially Quantified Variables in Induction Specification Proofs
Brigitte Pientka, Christoph Kreitz
Knowledge Discovery Objects and Queries in Distributed Knowledge Systems
Zbigniew W. Ras, Jiyun Zheng
ALLTYPES: An ALgebraic Language and TYPE System
Fritz Schwarz
Real Parametrization of Algebraic Curves
J. Rafael Sendra, Franz Winkler
Non-Clausal Reasoning with Propositional Definite Theories
Zbigniew Stachniak
Invited Talks
An Inductive Logic Programming Query Language for Database Mining (Extended Abstract)
Luc De Raedt
Bertrand Russell, Herbrands theorem, and the assignment statement
Melvin Fitting
Representing and Reasoning with Context
Richmond H. Thomason
Regular Talks
From Integrated Reasoning to lug-and-Play' Reasoning Components
Alessandro Armando, Silvio Ranise
Reasoning about Coding Theory: The Benefits We Get from Computer Algebra
Clemens Ballarin, Lawrence C. Paulson
Automatic Generation of Epsilon-Delta Proofs of Continuity
Michael Beeson
Finite Model Search for Equational Theories (FMSET)
Belaid Benhamou, Laurent Heocque
Specification and Integration of Theorem Provers and Computer Algebra Systems
P.G.Bertoli, J.Calmet, F. Giunchiglia, K.Homann
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language Carlos Castro
An Evolutionary Algorithm for Welding Task Sequence Ordering
Martin Damsbo, Peder Thusgaard Ruhoff
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis
Uwe Egli, Stephan Schmitt
Combining Algebraic Computing and Term-Rewriting for Geometry Theorem Proving
Stéphane Fèvre, Dongming Wang
Cooperation between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
Dirk Fuchs
Polymorphic Call-by-Value Calculus based on Classical Proofs (Extended Abstract)
Ken-etsu Fujita
Inference and Verification in Medical Appropriateness Criteria using Grobner Bases
L.M. Laita, E. Roanes-Lozano, V. Maojo
The Unification Problem for One Relation Thue Systems
Christopher Lynch
Basic Completion with E-cycle Simplification
Christopher Lynch, Christelle Scharff
SoleX: a Domain-Independent Scheme for Constraint Solver Extension
Eric Monfroy, Christophe Ringeissen
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Ian Horrocks, Peter F.Patel-Schneider
Instantiation of Existentially Quantified Variables in Induction Specification Proofs
Brigitte Pientka, Christoph Kreitz
Knowledge Discovery Objects and Queries in Distributed Knowledge Systems
Zbigniew W. Ras, Jiyun Zheng
ALLTYPES: An ALgebraic Language and TYPE System
Fritz Schwarz
Real Parametrization of Algebraic Curves
J. Rafael Sendra, Franz Winkler
Non-Clausal Reasoning with Propositional Definite Theories
Zbigniew Stachniak