Automated reasoning : Second international joint conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004 : proceedings
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...
Na minha lista:
| Autor principal: | |
|---|---|
| Autor Corporativo: | |
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science. Lecture notes in artificial intelligence
3097 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automated reasoning, Second international joint conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, proceedings, David Basin, Michaël Rusinowitsch (eds.), Berlin, Springer, 2004, 1 vol. (XII-491 p.), Lecture notes in computer science, 3-540-22345-2 • Automated Reasoning, Texte imprimé, 9783662182840 |
Sumário:
- 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
- SolvingConstraints 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.