Design and Implementation of Symbolic Computation Systems [[electronic resource] ] : International Symposium, DISCO '96, Karlsruhe, Germany, September 18-20, 1996. Proceedings / / edited by Jacques Calmet, Carla Limongelli |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (IX, 362 p.) |
Disciplina | 005.1/31 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Computer science—Mathematics Algorithms Software engineering Artificial intelligence Theory of Computation Symbolic and Algebraic Manipulation Software Engineering/Programming and Operating Systems Artificial Intelligence |
ISBN | 3-540-70635-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Problem-oriented applications of automated theorem proving -- ?IT — A strongly-typed embeddable computer algebra library -- DiscAtinf: A general framework for implementing calculi and strategies -- Equality elimination for the tableau method -- Towards lean proof checking -- WALDMEISTER: High performance equation theorem proving -- A reflective language based on conditional term rewriting -- Term rewriting systems: An h-categorical semantic -- Generative geometric modeling in a functional environment -- Exploiting SML for experimenting with algebraic algorithms: The example of p-adic lifting -- Conditional categories and domains -- Parameterizing object specifications -- Analyzing the dynamics of a Z specification -- Walking faster -- Integer and rational arithmetic on masPar -- Parallel 3-primes FFT algorithm -- A master-slave approach to parallel term rewriting on a hierarchical multiprocessor -- Multi-agent cooperation — Concepts and applications -- Document-centered presentation of computing software: Compound documents are better workspaces -- Animating a non-executable formal specification with a distributed symbolic language -- Uniform representation of basic algebraic structures in computer algebra -- Integrating computer algebra with proof planning -- Structures for symbolic mathematical reasoning and computation -- Implementing FS0 in Isabelle: Adding structure at the metalevel -- An approach to class reasoning in symbolic computation -- An intelligent interface to numerical routines -- Computer algebra and the World Wide Web -- Interfacing REDUCE to Java -- Software architectures for computer algebra: A case study -- A deductive database for mathematical formulas -- CASA — A system for Computer Aided Constructive Algebraic geometry -- Making systems communicate and cooperate: The Central Control approach -- A database for number fields -- Compiling residuation for a multiparadigm symbolic programming language -- Pluggability issues in the Multi Protocol. |
Record Nr. | UNISA-996465850003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Learning Language in Logic [[electronic resource] /] / edited by James Cussens, Saso Dzeroski |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (X, 306 p.) |
Disciplina | 005.1/31 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages |
ISBN | 3-540-40030-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introductions & Overviews -- An Introduction to Inductive Logic Programming and Learning Language in Logic -- A Brief Introduction to Natural Language Processing for Non-linguists -- A Closer Look at the Automatic Induction of Linguistic Knowledge -- Learning for Semantic Interpretation: Scaling Up without Dumbing Down -- Morphology & Phonology -- Learning to Lemmatise Slovene Words -- Achievements and Prospects of Learning Word Morphology with Inductive Logic Programming -- Learning the Logic of Simple Phonotactics -- Syntax -- Grammar Induction as Substructural Inductive Logic Programming -- Experiments in Inductive Chart Parsing -- ILP in Part-of-Speech Tagging — An Overview -- Iterative Part-of-Speech Tagging -- DCG Induction Using MDL and Parsed Corpora -- Learning Log-Linear Models on Constraint-Based Grammars for Disambiguation -- Unsupervised Lexical Learning with Categorial Grammars Using the LLL Corpus -- Induction of Recursive Transfer Rules -- Learning for Text Categorization and Information Extraction with ILP -- Corpus-Based Learning of Semantic Relations by the ILP System, Asium -- Improving Learning by Choosing Examples Intelligently in Two Natural Language Tasks. |
Record Nr. | UNISA-996466346803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Learning Language in Logic / / edited by James Cussens, Saso Dzeroski |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (X, 306 p.) |
Disciplina | 005.1/31 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages |
ISBN | 3-540-40030-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introductions & Overviews -- An Introduction to Inductive Logic Programming and Learning Language in Logic -- A Brief Introduction to Natural Language Processing for Non-linguists -- A Closer Look at the Automatic Induction of Linguistic Knowledge -- Learning for Semantic Interpretation: Scaling Up without Dumbing Down -- Morphology & Phonology -- Learning to Lemmatise Slovene Words -- Achievements and Prospects of Learning Word Morphology with Inductive Logic Programming -- Learning the Logic of Simple Phonotactics -- Syntax -- Grammar Induction as Substructural Inductive Logic Programming -- Experiments in Inductive Chart Parsing -- ILP in Part-of-Speech Tagging — An Overview -- Iterative Part-of-Speech Tagging -- DCG Induction Using MDL and Parsed Corpora -- Learning Log-Linear Models on Constraint-Based Grammars for Disambiguation -- Unsupervised Lexical Learning with Categorial Grammars Using the LLL Corpus -- Induction of Recursive Transfer Rules -- Learning for Text Categorization and Information Extraction with ILP -- Corpus-Based Learning of Semantic Relations by the ILP System, Asium -- Improving Learning by Choosing Examples Intelligently in Two Natural Language Tasks. |
Record Nr. | UNINA-9910143616703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Static Analysis [[electronic resource] ] : Second International Symposium, SAS '95, Glasgow, UK, September 25 - 27, 1995. Proceedings / / edited by Alan Mycroft |
Edizione | [1st ed. 1995.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
Descrizione fisica | 1 online resource (IX, 431 p.) |
Disciplina | 005.1/31 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Computers Computer programming Programming languages (Electronic computers) Computer logic Software Engineering/Programming and Operating Systems Theory of Computation Programming Techniques Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
ISBN | 3-540-45050-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Natural-semantics-based abstract interpretation (preliminary version) -- Region inference for higher-order functional languages -- An automata-theoretic approach to Presburger arithmetic constraints -- Generation of efficient interprocedural analyzers with PAG -- Optimality in abstractions of model checking -- Determining storage properties of sequential and concurrent programs with assignment and structured data -- Partitioning non-strict functional languages for multi-threaded code generation -- Complementation in abstract interpretation -- Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time -- Optimizing lazy functional programs using flow inference -- Termination analysis for functional programs using term orderings -- A type-based analysis for stack allocation in functional languages -- Control-flow analysis and type systems -- Effective flow analysis for avoiding run-time checks -- Static analysis of communication for asynchronous concurrent programming languages -- Unification-free execution of well-moded and well-typed Prolog programs -- Efficient closure utilisation by higher-order inheritance analysis -- System F and abstract interpretation -- Call-by-name CPS-translation as a binding-time improvement -- Trust in the ?-calculus -- LSign reordered -- Strictness analysis by abstract reduction using a tableau calculus -- Bigloo: a portable and optimizing compiler for strict functional languages -- Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell -- Binding-time analysis and strictness analysis by abstract interpretation -- GENA — A tool for generating Prolog analyzers from specifications -- IGOR: A tool for developing Prolog dataflow analyzers. |
Record Nr. | UNISA-996466105303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|