Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_BV019379979
    Format: XII, 491 S. : , graph. Darst.
    ISBN: 3-540-22345-2
    Series Statement: Lecture notes in computer science 3097 : Lecture notes in artificial intelligence
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Automatisches Beweisverfahren ; Programmierlogik ; Beweistheorie ; Logik ; Konferenzschrift ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947920451902882
    Format: XII, 491 p. , online resource.
    ISBN: 9783540259848
    Series Statement: Lecture Notes in Computer Science, 3097
    Content: This volume constitutes the proceedings of the 2nd International Joint C- ference on Automated Reasoning (IJCAR 2004) held July 4–8, 2004 in Cork, Ireland. IJCAR 2004 continued the tradition established at the ?rst IJCAR in Siena,Italyin2001,whichbroughttogetherdi?erentresearchcommunitieswo- ing in automated reasoning. The current IJCAR is the fusion of the following conferences: CADE: The International Conference on Automated Deduction, CALCULEMUS: Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, FroCoS: Workshop on Frontiers of Combining Systems, FTP: The International Workshop on First-Order Theorem Proving, and TABLEAUX: The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. There were 74 research papers submitted to IJCAR as well as 12 system descriptions. After extensive reviewing, 26 research papers and 6 system - scriptions were accepted for presentation at the conference and publication in this volume. In addition, this volume also contains papers from the three invited speakers and a description of the CADE ATP system competition. We would like to acknowledge the enormous amount of work put in by the members of the program committee, the various organizing and steering c- mittees, the IJCAR o?cials, the invited speakers, and the additional referees named on the following pages. We would also like to thank Achim Brucker and Barbara Geiser for their help in producing this volume.
    Note: Rewriting -- Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools -- A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting -- Efficient Checking of Term Ordering Constraints -- Improved Modular Termination Proofs Using Dependency Pairs -- Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure -- Saturation-Based Theorem Proving -- Redundancy Notions for Paramodulation with Non-monotonic Orderings -- A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards -- Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures -- Combination Techniques -- Decision Procedures for Recursive Data Structures with Integer Constraints -- Modular Proof Systems for Partial Functions with Weak Equality -- A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics -- Verification and Systems -- Using Automated Theorem Provers to Certify Auto-generated Aerospace Software -- argo-lib: A Generic Platform for Decision Procedures -- The ICS Decision Procedures for Embedded Deduction -- System Description: E 0.81 -- Reasoning with Finite Structure -- Second-Order Logic over Finite Structures – Report on a Research Programme -- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains -- Tableaux and Non-classical Logics -- PDL with Negation of Atomic Programs -- Counter-Model Search in Gödel-Dummett Logics -- Generalised Handling of Variables in Disconnection Tableaux -- Applications and Systems -- Chain Resolution for the Semantic Web -- Sonic — Non-standard Inferences Go OilEd -- TeMP: A Temporal Monodic Prover -- Dr.Doodle: A Diagrammatic Theorem Prover -- Computer Mathematics -- Solving Constraints by Elimination Methods -- Analyzing Selected Quantified Integer Programs -- Interactive Theorem Proving -- Formalizing O Notation in Isabelle/HOL -- Experiments on Supporting Interactive Proof Using Resolution -- A Machine-Checked Formalization of the Generic Model and the Random Oracle Model -- Combinatorial Reasoning -- Automatic Generation of Classification Theorems for Finite Algebras -- Efficient Algorithms for Computing Modulo Permutation Theories -- Overlapping Leaf Permutative Equations -- Higher-Order Reasoning -- TaMeD: A Tableau Method for Deduction Modulo -- Lambda Logic -- Formalizing Undefinedness Arising in Calculus -- Competition -- The CADE ATP System Competition.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540223450
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_9948621669402882
    Format: XII, 491 p. , online resource.
    Edition: 1st ed. 2004.
    ISBN: 9783540259848
    Series Statement: Lecture Notes in Artificial Intelligence ; 3097
    Content: This volume constitutes the proceedings of the 2nd International Joint C- ference on Automated Reasoning (IJCAR 2004) held July 4-8, 2004 in Cork, Ireland. IJCAR 2004 continued the tradition established at the ?rst IJCAR in Siena,Italyin2001,whichbroughttogetherdi?erentresearchcommunitieswo- ing in automated reasoning. The current IJCAR is the fusion of the following conferences: CADE: The International Conference on Automated Deduction, CALCULEMUS: Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, FroCoS: Workshop on Frontiers of Combining Systems, FTP: The International Workshop on First-Order Theorem Proving, and TABLEAUX: The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. There were 74 research papers submitted to IJCAR as well as 12 system descriptions. After extensive reviewing, 26 research papers and 6 system - scriptions were accepted for presentation at the conference and publication in this volume. In addition, this volume also contains papers from the three invited speakers and a description of the CADE ATP system competition. We would like to acknowledge the enormous amount of work put in by the members of the program committee, the various organizing and steering c- mittees, the IJCAR o?cials, the invited speakers, and the additional referees named on the following pages. We would also like to thank Achim Brucker and Barbara Geiser for their help in producing this volume.
    Note: Rewriting -- Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools -- A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting -- Efficient Checking of Term Ordering Constraints -- Improved Modular Termination Proofs Using Dependency Pairs -- Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure -- Saturation-Based Theorem Proving -- Redundancy Notions for Paramodulation with Non-monotonic Orderings -- A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards -- Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures -- Combination Techniques -- Decision Procedures for Recursive Data Structures with Integer Constraints -- Modular Proof Systems for Partial Functions with Weak Equality -- A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics -- Verification and Systems -- Using Automated Theorem Provers to Certify Auto-generated Aerospace Software -- argo-lib: A Generic Platform for Decision Procedures -- The ICS Decision Procedures for Embedded Deduction -- System Description: E 0.81 -- Reasoning with Finite Structure -- Second-Order Logic over Finite Structures - Report on a Research Programme -- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains -- Tableaux and Non-classical Logics -- PDL with Negation of Atomic Programs -- Counter-Model Search in Gödel-Dummett Logics -- Generalised Handling of Variables in Disconnection Tableaux -- Applications and Systems -- Chain Resolution for the Semantic Web -- Sonic - Non-standard Inferences Go OilEd -- TeMP: A Temporal Monodic Prover -- Dr.Doodle: A Diagrammatic Theorem Prover -- Computer Mathematics -- Solving Constraints by Elimination Methods -- Analyzing Selected Quantified Integer Programs -- Interactive Theorem Proving -- Formalizing O Notation in Isabelle/HOL -- Experiments on Supporting Interactive Proof Using Resolution -- A Machine-Checked Formalization of the Generic Model and the Random Oracle Model -- Combinatorial Reasoning -- Automatic Generation of Classification Theorems for Finite Algebras -- Efficient Algorithms for Computing Modulo Permutation Theories -- Overlapping Leaf Permutative Equations -- Higher-Order Reasoning -- TaMeD: A Tableau Method for Deduction Modulo -- Lambda Logic -- Formalizing Undefinedness Arising in Calculus -- Competition -- The CADE ATP System Competition.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783540223450
    Additional Edition: Printed edition: ISBN 9783662182840
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_389599212
    Format: XII, 491 S , graph. Darst
    ISBN: 3540223452
    Series Statement: Lecture notes in computer science 3097
    Content: This book constitutes the refereed proceedings of the Second International Joint Conference on Automated Reasoning, IJCAR 2004, held in Cork, Ireland, in July 2004. IJCAR 2004 comprises CADE, CALCULEMUS, , FroCoS, FTP, and TABLEAUX. The 26 revised full research papers and 6 revised system demonstrations presented together with 3 invited papers and a summary of a systems competition were carefully reviewed and selected from a total of 86 submissions. The papers are organized in topical sections on rewriting, saturation-based theorem proving, combination techniques, verification and systems, reasoning with finite structure, tableaux and non-classical logics, applications and systems, computer mathematics, interactive theorem proving, combinatorial reasoning, and higher-order reasoning
    Note: Literaturangaben
    Additional Edition: Erscheint auch als Online-Ausgabe Basin, David Automated Reasoning Berlin, Heidelberg : Springer Berlin Heidelberg, 2004 ISBN 9783540223450
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Semantic Web ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540223405?
Did you mean 9783540207450?
Did you mean 9783540083450?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages