Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
9th International Conference on Automated Deduction [[electronic resource] ] : Argonne, Illinois, USA, May 23-26, 1988. Proceedings / / edited by Ewing Lusk, Ross Overbeek
| 9th International Conference on Automated Deduction [[electronic resource] ] : Argonne, Illinois, USA, May 23-26, 1988. Proceedings / / edited by Ewing Lusk, Ross Overbeek |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (X, 776 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
| ISBN | 3-540-39216-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | First-order theorem proving using conditional rewrite rules -- Elements of Z-module reasoning -- Learning and applying generalised solutions using higher order resolution -- Specifying theorem provers in a higher-order logic programming language -- Query processing in quantitative logic programming -- An environment for automated reasoning about partial functions -- The use of explicit plans to guide inductive proofs -- Logicalc: An environment for interactive proof development -- Implementing verification strategies in the KIV-system -- Checking natural language proofs -- Consistency of rule-based expert systems -- A mechanizable induction principle for equational specifications -- Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time -- Towards efficient "knowledge-based" automated theorem proving for non-standard logics -- Propositional temporal interval logic is PSPACE complete -- Computational metatheory in Nuprl -- Type inference in Prolog -- Procedural interpretation of non-horn logic programs -- Recursive query answering with non-horn clauses -- Case inference in resolution-based languages -- Notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine -- Exploitation of parallelism in prototypical deduction problems -- A decision procedure for unquantified formulas of graph theory -- Adventures in associative-commutative unification (A summary) -- Unification in finite algebras is unitary(?) -- Unification in a combination of arbitrary disjoint equational theories -- Partial unification for graph based equational reasoning -- SATCHMO: A theorem prover implemented in Prolog -- Term rewriting: Some experimental results -- Analogical reasoning and proof discovery -- Hyper-chaining and knowledge-based theorem proving -- Linear modal deductions -- A resolution calculus for modal logics -- Solving disequations in equational theories -- On word problems in Horn theories -- Canonical conditional rewrite systems -- Program synthesis by completion with dependent subtypes -- Reasoning about systems of linear inequalities -- A subsumption algorithm based on characteristic matrices -- A restriction of factoring in binary resolution -- Supposition-based logic for automated nonmonotonic reasoning -- Argument-bounded algorithms as a basis for automated termination proofs -- Two automated methods in implementation proofs -- A new approach to universal unfication and its application to AC-unification -- An implementation of a dissolution-based system employing theory links -- Decision procedure for autoepistemic logic -- Logical matrix generation and testing -- Optimal time bounds for parallel term matching -- Challenge equality problems in lattice theory -- Single axioms in the implicational propositional calculus -- Challenge problems focusing on equality and combinatory logic: Evaluating automated theorem-proving programs -- Challenge problems from nonassociative rings for theorem provers -- An interactive enhancement to the Boyer-Moore theorem prover -- A goal directed theorem prover -- m-NEVER system summary -- EFS — An interactive Environment for Formal Systems -- Ontic: A knowledge representation system for mathematics -- Some tools for an inference laboratory (ATINF) -- Quantlog: A system for approximate reasoning in inconsistent formal systems -- LP: The larch prover -- The KLAUS automated deduction system -- A Prolog technology theorem prover -- ?Prolog: An extended logic programming language -- SYMEVAL: A theorem prover based on the experimental logic -- ZPLAN: An automatic reasoning system for situations -- The TPS theorem proving system -- MOLOG: A modal PROLOG -- PARTHENON: A parallel theorem prover for non-horn clauses -- An nH-Prolog implementation -- RRL: A rewrite rule laboratory -- Geometer: A theorem prover for algebraic geometry -- Isabelle: The next seven hundred theorem provers -- The CHIP system : Constraint handling in Prolog. |
| Record Nr. | UNISA-996465689403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
9th International Conference on Practical Applications of Computational Biology and Bioinformatics [[electronic resource] /] / edited by Ross Overbeek, Miguel P. Rocha, Florentino Fdez-Riverola, Juan F. De Paz
| 9th International Conference on Practical Applications of Computational Biology and Bioinformatics [[electronic resource] /] / edited by Ross Overbeek, Miguel P. Rocha, Florentino Fdez-Riverola, Juan F. De Paz |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource |
| Disciplina | 572.80285 |
| Collana | Advances in Intelligent Systems and Computing |
| Soggetto topico |
Computational intelligence
Artificial intelligence Bioinformatics Chemoinformatics Computational Intelligence Artificial Intelligence Computational Biology/Bioinformatics Computer Applications in Chemistry |
| ISBN |
3-319-19775-4
3-319-19776-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Preliminary Assessment of Three Strategies for the Agent-Based Modeling of Bacterial Conjugation -- Carotenoid Analysis of Cassava Genotypes Roots (Manihot Esculenta Crantz) Cultivated in Southern Brazil Using Chemometric Tools -- UV-Visible Scanning Spectrophotometry and Chemometric Analysis As Tools to Build Descriptive And Classification Models for Propolis from Southern Brazil -- UV-Visible Spectrophotometry-Based Metabolomic Analysis of Cedrela Fissilis Velozzo (Meliaceae) Calluses - A Screening Tool for Culture Medium Composition and Cell Metabolic Profiles -- An Integrated Computational Platform for Metabolomics Data Analysis -- Compound Identification in Comprehensive Gas Chromatography - Mass Spectrometry-Based Metabolomics by Blind Source Separation -- Dolphin 1D: Improving Automation of Targeted Metabolomics in Multi-Matrix Datasets Of 1H-NMR Spectra -- A New Dimensionality Reduction Technique Based On HMM for Boosting Document Classification -- Diagnostic Knowledge Extraction from Medlineplus: An Application for Infectious Diseases -- A Text Mining Approach for the Extraction Of Kinetic Information from Literature -- A Novel Search Engine Supporting Specific Drug Queries And Literature Management -- Ganoderma Australe Transcriptome Analysis with Hidden Markov Model And Bayesian Inference Approaches -- A New Bioinformatic Pipeline to Address The Most Common Requirements in RNA-Seq Data Analysis -- Microarray Gene Expression Data Integration: An Application to Brain Tumor Grade Determination -- Obtaining Relevant Genes by Analysis of Expression Arrays with a Multi-Agent System. |
| Record Nr. | UNINA-9910299817803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||