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.
Advances in Case-Based Reasoning [[electronic resource] ] : Third European Workshop, EWCBR-96, Lausanne, Switzerland, November 14 - 16, 1996, Proceedings / / edited by Ian Smith, Boi Faltings
| Advances in Case-Based Reasoning [[electronic resource] ] : Third European Workshop, EWCBR-96, Lausanne, Switzerland, November 14 - 16, 1996, Proceedings / / edited by Ian Smith, Boi Faltings |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 538 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Artificial Intelligence |
| ISBN | 3-540-49568-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How different is different? -- Towards CBR for bioprocess planning -- On the role of abstraction in case-based reasoning -- ISAC: A CBR system for decision support in air traffic control -- Structural similarity and adaptation -- Justification structures for document reuse -- Adaptation-guided retrieval in EBMT: A case-based approach to machine translation -- Dynamically creating indices for two million cases: A real world problem -- Case memory and the behaviouristic model of concepts and cognition -- Supporting object reuse through case-based reasoning -- Meta-cases: Explaining case-based reasoning -- A two layer case-based reasoning architecture for medical image understanding -- Learning adaptation rules from a case-base -- An evolutionary agent model of case-based classification -- Using description logics for knowledge intensive case-based reasoning -- Applying case retrieval nets to diagnostic tasks in technical domains -- Plans as structured networks of hierarchically and temporally related case pieces -- The transfer problem in analogical reuse -- A case-based system for adaptive hypermedia navigation -- Feature weighting by explaining case-based planning episodes -- Classification-based problem-solving in case-based reasoning -- A case base similarity framework -- On the importance of similitude: An entropy-based assessment -- Case-enhanced configuration by resource balancing -- Adaptation cost as a criterion for solution evaluation -- Fish and Shrink. A next step towards efficient case retrieval in large scaled case bases -- Abstractions of data and time for multiparametric time course prognoses -- The utility problem analysed -- REPRO: Supporting flowsheet design by case-base retrieval -- A bayesian framework for case-based reasoning -- Principles of case reusing systems -- Using typicality theory to select the best match -- Considering decision cost during learning of feature weights -- Case-Based problem solving methods for parametric design tasks -- Corporate knowledge management for the millennium -- Case-based reasoning techniques applied to operation experience feedback in nuclear power plants -- Troubleshooting CFM 56-3 engines for the Boeing 737 using CBR and data-mining -- Global case-base development and deployment. |
| Record Nr. | UNISA-996465950203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction - CADE-18 [[electronic resource] ] : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov
| Automated Deduction - CADE-18 [[electronic resource] ] : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Programming languages (Electronic computers) Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45620-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Description Logics and Semantic Web -- Reasoning with Expressive Description Logics: Theory and Practice -- BDD-Based Decision Procedures for -- Proof-Carrying Code and Compiler Verification -- Temporal Logic for Proof-Carrying Code -- A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code -- Formal Verification of a Java Compiler in Isabelle -- Non-classical Logics -- Embedding Lax Logic into Intuitionistic Logic -- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic -- Connection-Based Proof Search in Propositional BI Logic -- System Descriptions -- DDDLIB: A Library for Solving Quantified Difference Inequalities -- An LCF-Style Interface between HOL and First-Order Logic -- System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning -- Proof Development with ?mega -- Learn?matic: System Description -- HyLoRes 1.0: Direct Resolution for Hybrid Logics -- SAT -- Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points -- A Note on Symmetry Heuristics in SEM -- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions -- Model Generation -- Deductive Search for Errors in Free Data Type Specifications Using Model Generation -- Reasoning by Symmetry and Function Ordering in Finite Model Generation -- Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations -- Session 7 -- A New Clausal Class Decidable by Hyperresolution -- CASC -- Spass Version 2.0 -- System Description: GrAnDe 1.0 -- The HR Program for Theorem Generation -- AutoBayes/CC — Combining Program Synthesis with Automatic Code Certification — System Description — -- CADE-CAV Invited Talk -- The Quest for Efficient Boolean Satisfiability Solvers -- Session 9 -- Recursive Path Orderings Can Be Context-Sensitive -- Combination of Decision Procedures -- Shostak Light -- Formal Verification of a Combination Decision Procedure -- Combining Multisets with Integers -- Logical Frameworks -- The Reflection Theorem: A Study in Meta-theoretic Reasoning -- Faster Proof Checking in the Edinburgh Logical Framework -- Solving for Set Variables in Higher-Order Theorem Proving -- Model Checking -- The Complexity of the Graded ?-Calculus -- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains -- Equational Reasoning -- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation -- Basic Syntactic Mutation -- The Next Waldmeister Loop -- Proof Theory -- Focussing Proof-Net Construction as a Middleware Paradigm -- Proof Analysis by Resolution. |
| Record Nr. | UNISA-996465523403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction - CADE-18 : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov
| Automated Deduction - CADE-18 : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Computer logic Programming languages (Electronic computers) Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45620-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Description Logics and Semantic Web -- Reasoning with Expressive Description Logics: Theory and Practice -- BDD-Based Decision Procedures for -- Proof-Carrying Code and Compiler Verification -- Temporal Logic for Proof-Carrying Code -- A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code -- Formal Verification of a Java Compiler in Isabelle -- Non-classical Logics -- Embedding Lax Logic into Intuitionistic Logic -- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic -- Connection-Based Proof Search in Propositional BI Logic -- System Descriptions -- DDDLIB: A Library for Solving Quantified Difference Inequalities -- An LCF-Style Interface between HOL and First-Order Logic -- System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning -- Proof Development with ?mega -- Learn?matic: System Description -- HyLoRes 1.0: Direct Resolution for Hybrid Logics -- SAT -- Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points -- A Note on Symmetry Heuristics in SEM -- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions -- Model Generation -- Deductive Search for Errors in Free Data Type Specifications Using Model Generation -- Reasoning by Symmetry and Function Ordering in Finite Model Generation -- Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations -- Session 7 -- A New Clausal Class Decidable by Hyperresolution -- CASC -- Spass Version 2.0 -- System Description: GrAnDe 1.0 -- The HR Program for Theorem Generation -- AutoBayes/CC — Combining Program Synthesis with Automatic Code Certification — System Description — -- CADE-CAV Invited Talk -- The Quest for Efficient Boolean Satisfiability Solvers -- Session 9 -- Recursive Path Orderings Can Be Context-Sensitive -- Combination of Decision Procedures -- Shostak Light -- Formal Verification of a Combination Decision Procedure -- Combining Multisets with Integers -- Logical Frameworks -- The Reflection Theorem: A Study in Meta-theoretic Reasoning -- Faster Proof Checking in the Edinburgh Logical Framework -- Solving for Set Variables in Higher-Order Theorem Proving -- Model Checking -- The Complexity of the Graded ?-Calculus -- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains -- Equational Reasoning -- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation -- Basic Syntactic Mutation -- The Next Waldmeister Loop -- Proof Theory -- Focussing Proof-Net Construction as a Middleware Paradigm -- Proof Analysis by Resolution. |
| Record Nr. | UNINA-9910143883803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Deduction in Classical and Non-Classical Logics [[electronic resource] ] : Selected Papers / / edited by Ricardo Caferra, Gernot Salzer
| Automated Deduction in Classical and Non-Classical Logics [[electronic resource] ] : Selected Papers / / edited by Ricardo Caferra, Gernot Salzer |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 304 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-46508-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory -- Higher-Order Modal Logic—A Sketch -- Proving Associative-Commutative Termination Using RPO-Compatible Orderings -- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction -- Replacement Rules with Definition Detection -- Contributed Papers -- On the Complexity of Finite Sorted Algebras -- A Further and Effective Liberalization of the ?-Rule in Free Variable Semantic Tableaux -- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory -- Interpretation of a Mizar-Like Logic in First Order Logic -- An ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic -- Implicational Completeness of Signed Resolution -- An Equational Re-engineering of Set Theories -- Issues of Decidability for Description Logics in the Framework of Resolution -- Extending Decidable Clause Classes via Constraints -- Completeness and Redundancy in Constrained Clause Logic -- Effective Properties of Some First Order Intuitionistic Modal Logics -- Hidden Congruent Deduction -- Resolution-Based Theorem Proving for SH n-Logics -- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized ?-Rule but Without Skolemization. |
| Record Nr. | UNISA-996465581903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction in Classical and Non-Classical Logics : Selected Papers / / edited by Ricardo Caferra, Gernot Salzer
| Automated Deduction in Classical and Non-Classical Logics : Selected Papers / / edited by Ricardo Caferra, Gernot Salzer |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 304 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-46508-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory -- Higher-Order Modal Logic—A Sketch -- Proving Associative-Commutative Termination Using RPO-Compatible Orderings -- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction -- Replacement Rules with Definition Detection -- Contributed Papers -- On the Complexity of Finite Sorted Algebras -- A Further and Effective Liberalization of the ?-Rule in Free Variable Semantic Tableaux -- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory -- Interpretation of a Mizar-Like Logic in First Order Logic -- An ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic -- Implicational Completeness of Signed Resolution -- An Equational Re-engineering of Set Theories -- Issues of Decidability for Description Logics in the Framework of Resolution -- Extending Decidable Clause Classes via Constraints -- Completeness and Redundancy in Constrained Clause Logic -- Effective Properties of Some First Order Intuitionistic Modal Logics -- Hidden Congruent Deduction -- Resolution-Based Theorem Proving for SH n-Logics -- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized ?-Rule but Without Skolemization. |
| Record Nr. | UNINA-9910143638903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated deduction, CADE-14 : 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997 : proceedings / / William McCune, ed
| Automated deduction, CADE-14 : 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997 : proceedings / / William McCune, ed |
| Pubbl/distr/stampa | Springer Berlin / Heidelberg |
| Disciplina | 006.3/33 |
| Altri autori (Persone) | McCuneWilliam |
| Soggetto topico |
Automatic theorem proving - Congresses
Logic, Symbolic and mathematical - Congresses |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465556603316 |
| Springer Berlin / Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow
| Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 712 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Mathematical Logic and Foundations |
| ISBN | 3-540-45744-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Program Termination Analysis by Size-Change Graphs (Abstract) -- SET Cardholder Registration: The Secrecy Proofs -- SET Cardholder Registration: The Secrecy Proofs -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Description, Modal and temporal Logics -- The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach -- NExpTime-Complete Description Logics with Concrete Domains -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- The Hybrid ?-Calculus -- The Hybrid ?-Calculus -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Tableaux for Temporal Description Logic with Constant Domains -- Tableaux for Temporal Description Logic with Constant Domains -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Saturation Based Theorem Proving, Applications, and Data Structures -- Instructing Equational Set-Reasoning with Otter -- NP-Completeness of Refutability by Literal-Once Resolution -- Ordered Resolution vs. Connection Graph resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Context Trees -- Context Trees -- On the Evaluation of Indexing Techniques for Theorem Proving -- On the Evaluation of Indexing Techniques for Theorem Proving -- Logic Programming and Nonmonotonic Reasoning -- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation -- Bunched Logic Programming -- A Top-Down Procedure for Disjunctive Well-Founded Semantics -- A Second-Order Theorem Prover Applied to Circumscription -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- Propositional Satisfiability and Quantified Boolean Logic -- Conditional Pure Literal Graphs -- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability -- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability -- System Abstract: E 0.61 -- Vampire 1.1 -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving -- More On Implicit Syntax -- Termination and Reduction Checking for Higher-Order Logic Programs -- P.rex: An Interactive Proof Explainer -- JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants -- Semantic Guidance -- The eXtended Least Number Heuristic -- System Description: SCOTT-5 -- Combination of Distributed Search and Multi-Search in Peers-mcd.d -- Lotrec: The Generic Tableau Prover for Modal and Description Logics -- The modprof Theorem Prover -- A New System and Methodology for Generating Random Modal Formulae -- Equational Theorem Proving and Term Rewriting -- Decidable Classes of Inductive Theorems -- Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems -- Decidability and Complexity of Finitely Closable Linear Equational Theories -- A New Meta-Complexity Theorem for Bottom-Up Logic Programs -- Tableau, Sequent, Natural Deduction Calculi and Proof Theory -- Canonical Propositional Gentzen-Type Systems -- Incremental Closure of Free Variable Tableaux -- Deriving Modular Programs from Short Proofs -- A General Method for Using Schematizations in Automated Deduction -- Automata, Specification, Verification, and Logics of Programs -- Approximating Dependency Graphs Using Tree Automata Techniques -- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables -- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities -- Flaw Detection in Formal Specifications -- CCE: Testing Ground Joinability -- System Description: RDL Rewrite and Decision Procedure Laboratory -- lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic -- Nonclassical Logics -- Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction -- Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory -- STRIP: Structural Sharing for Efficient Proof-Search -- RACER System Description. |
| Record Nr. | UNISA-996466069003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow
| Automated Reasoning : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 712 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Logic, Symbolic and mathematical Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Mathematical Logic and Foundations |
| ISBN | 3-540-45744-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Program Termination Analysis by Size-Change Graphs (Abstract) -- SET Cardholder Registration: The Secrecy Proofs -- SET Cardholder Registration: The Secrecy Proofs -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Description, Modal and temporal Logics -- The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach -- NExpTime-Complete Description Logics with Concrete Domains -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- The Hybrid ?-Calculus -- The Hybrid ?-Calculus -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Tableaux for Temporal Description Logic with Constant Domains -- Tableaux for Temporal Description Logic with Constant Domains -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Saturation Based Theorem Proving, Applications, and Data Structures -- Instructing Equational Set-Reasoning with Otter -- NP-Completeness of Refutability by Literal-Once Resolution -- Ordered Resolution vs. Connection Graph resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution.-A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Context Trees -- Context Trees -- On the Evaluation of Indexing Techniques for Theorem Proving -- On the Evaluation of Indexing Techniques for Theorem Proving -- Logic Programming and Nonmonotonic Reasoning -- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation -- Bunched Logic Programming -- A Top-Down Procedure for Disjunctive Well-Founded Semantics -- A Second-Order Theorem Prover Applied to Circumscription -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- Propositional Satisfiability and Quantified Boolean Logic -- Conditional Pure Literal Graphs -- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability -- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability -- System Abstract: E 0.61 -- Vampire 1.1 -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving -- More On Implicit Syntax -- Termination and Reduction Checking for Higher-Order Logic Programs -- P.rex: An Interactive Proof Explainer -- JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants -- Semantic Guidance -- The eXtended Least Number Heuristic -- System Description: SCOTT-5 -- Combination of Distributed Search and Multi-Search in Peers-mcd.d -- Lotrec: The Generic Tableau Prover for Modal and Description Logics -- The modprof Theorem Prover -- A New System and Methodology for Generating Random Modal Formulae -- Equational Theorem Proving and Term Rewriting -- Decidable Classes of Inductive Theorems -- Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems -- Decidability and Complexity of Finitely Closable Linear Equational Theories -- A New Meta-Complexity Theorem for Bottom-Up Logic Programs -- Tableau, Sequent, Natural Deduction Calculi and Proof Theory -- Canonical Propositional Gentzen-Type Systems -- Incremental Closure of Free Variable Tableaux -- Deriving Modular Programs from Short Proofs -- A General Method for Using Schematizations in Automated Deduction -- Automata, Specification, Verification, and Logics of Programs -- Approximating Dependency Graphs Using Tree Automata Techniques -- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables -- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities -- Flaw Detection in Formal Specifications -- CCE: Testing Ground Joinability -- System Description: RDL Rewrite and Decision Procedure Laboratory -- lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic -- Nonclassical Logics -- Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction -- Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory -- STRIP: Structural Sharing for Efficient Proof-Search -- RACER System Description. |
| Record Nr. | UNINA-9910143596303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 346 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Software engineering Computer programming Artificial Intelligence Mathematical Logic and Formal Languages Software Engineering Programming Techniques |
| ISBN | 3-540-45616-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Proof Analysis by Resolution -- Using Linear Logic to Reason about Sequent Systems -- Research Papers -- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic -- Tableaux for Quantified Hybrid Logic -- Tableau-Based Automated Deduction for Duration Calculus -- Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge -- A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic -- Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks -- Tableau Calculi for the Logics of Finite k-Ary Trees -- A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition -- Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment -- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas -- Integration of Equality Reasoning into the Disconnection Calculus -- Analytic Sequent Calculi for Abelian and ?ukasiewicz Logics -- Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief -- A Confluent Theory Connection Calculus -- On Uniform Word Problems Involving Bridging Operators on Distributive Lattices -- Question Answering: From Partitions to Prolog -- A General Theorem Prover for Quantified Modal Logics -- Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem -- A New Indefinite Semantics for Hilbert’s Epsilon -- A Tableau Calculus for Combining Non-disjoint Theories -- System Descriptions Papers -- LINK: A Proof Environment Based on Proof Nets -- DCTP 1.2 — System Abstract. |
| Record Nr. | UNISA-996465375403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller
| Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 346 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Software engineering Computer programming Artificial Intelligence Mathematical Logic and Formal Languages Software Engineering Programming Techniques |
| ISBN | 3-540-45616-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Proof Analysis by Resolution -- Using Linear Logic to Reason about Sequent Systems -- Research Papers -- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic -- Tableaux for Quantified Hybrid Logic -- Tableau-Based Automated Deduction for Duration Calculus -- Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge -- A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic -- Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks -- Tableau Calculi for the Logics of Finite k-Ary Trees -- A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition -- Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment -- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas -- Integration of Equality Reasoning into the Disconnection Calculus -- Analytic Sequent Calculi for Abelian and ?ukasiewicz Logics -- Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief -- A Confluent Theory Connection Calculus -- On Uniform Word Problems Involving Bridging Operators on Distributive Lattices -- Question Answering: From Partitions to Prolog -- A General Theorem Prover for Quantified Modal Logics -- Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem -- A New Indefinite Semantics for Hilbert’s Epsilon -- A Tableau Calculus for Combining Non-disjoint Theories -- System Descriptions Papers -- LINK: A Proof Environment Based on Proof Nets -- DCTP 1.2 — System Abstract. |
| Record Nr. | UNINA-9910143899803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
