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.
10th International Conference on Automated Deduction [[electronic resource] ] : Kaiserslautern, FRG, July 24-27, 1990. Proceedings / / edited by Mark E. Stickel
| 10th International Conference on Automated Deduction [[electronic resource] ] : Kaiserslautern, FRG, July 24-27, 1990. Proceedings / / edited by Mark E. Stickel |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XVIII, 690 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-47171-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A theorem prover for a computational logic -- A complete semantic back chaining proof system -- Parallelizing the closure computation in automated deduction -- Partheo: A high-performance parallel theorem prover -- Substitution-based compilation of extended rules in deductive databases -- Automatic theorem proving in paraconsistent logics: Theory and implementation -- Case-free programs: An abstraction of definite horn programs -- Generalized well-founded semantics for logic programs -- Tactical theorem proving in program verification -- Extensions to the rippling-out tactic for guiding inductive proofs -- Guiding induction proofs -- Term rewriting induction -- A resolution principle for clauses with constraints -- Str+ve: The Str+ve-based subset prover -- Ritt-Wu's decomposition algorithm and geometry theorem proving -- Encoding a dependent-type ?-calculus in a logic programming language -- Investigations into proof-search in a system of first-order dependent function types -- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete -- An improved general E-unification method -- Some results on equational unification -- Unification in a combination of equational theories: an efficient algorithm -- SLIM: An automated reasoner for equivalences, applied to set theory -- An examination of the prolog technology theorem-prover -- Presenting intuitive deductions via symmetric simplification -- Toward mechanical methods for streamlining proofs -- Ordered rewriting and confluence -- Complete sets of reductions with constraints -- Rewrite systems for varieties of semigroups -- Improving associative path orderings -- Perspectives on automated deduction -- On restrictions of ordered paramodulation with simplification -- Simultaneous paramodulation -- Hyper resolution and equality axioms without function substitutions -- Automatic acquisition of search guiding heuristics -- Automated reasoning contributes to mathematics and logic -- A mechanically assisted constructive proof in category theory -- Dynamic logic as a uniform framework for theorem proving in intensional logic -- A tableaux-based theorem prover for a decidable subset of default logic -- Computing prime implicants -- Minimizing the number of clauses by renaming -- Higher order E-unification -- Programming by example and proving by example using higher-order unification -- Retrieving library identifiers via equational matching of types -- Unification in monoidal theories -- A science of reasoning: Extended abstract -- The TPS theorem proving system -- Schemata -- Cylindric algebra equation solver -- The OYSTER-CLAM system -- A high-performance parallel theorem prover -- The romulus proof checker -- IMPS : An interactive mathematical proof system -- UNICOM: A refined completion based inductive theorem prover -- The theorem prover of the program verifier Tatzelwurm -- RCL: A lisp verification system -- Orme an implementation of completion procedures as sets of transitions rules -- Otter 2.0 -- Dissolver: A dissolution-based theorem prover -- TRIP: An implementation of clausal rewriting -- OSCAR -- Expert thinker: An adaptation of F-Prolog to microcomputers -- A prolog technology theorem prover -- A general clause theorem prover -- Liss — The logic inference search system -- ACE: The abstract clause engine -- Tutorial on high-performance automated theorem proving -- Tutorial on reasoning and representation with concept languages -- Tutorial on ?Prolog -- Tutorial on equational unification -- Tutorial on compilation techniques for logics -- Tutorial on high-performance theorem provers: Efficient implementation and parallelisation -- Tutorial on rewrite-based theorem proving -- Tutorial on program-synthetic deduction -- Tutorial on computing models of propositional logics. |
| Record Nr. | UNISA-996465843003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning and Mathematics [[electronic resource] ] : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel
| Automated Reasoning and Mathematics [[electronic resource] ] : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 259 p. 27 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Computer science—Mathematics Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Math Applications in Computer Science |
| Soggetto genere / forma | Aufsatzsammlung |
| ISBN | 3-642-36675-9 |
| Classificazione |
DAT 700f
DAT 702f DAT 706f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466265003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning and Mathematics : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel
| Automated Reasoning and Mathematics : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 259 p. 27 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Computer science—Mathematics Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Math Applications in Computer Science |
| Soggetto genere / forma | Aufsatzsammlung |
| ISBN | 3-642-36675-9 |
| Classificazione |
DAT 700f
DAT 702f DAT 706f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483182703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||