| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465834403316 |
|
|
Titolo |
Frontiers of Combining Systems [[electronic resource] ] : 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings / / edited by Bernhard Gramlich |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
|
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 321 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 3717 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Artificial intelligence |
Mathematical logic |
Computer programming |
Software engineering |
Theory of Computation |
Artificial Intelligence |
Mathematical Logic and Formal Languages |
Programming Techniques |
Software Engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Logics, Theories, and Decision Procedures I -- A Comprehensive Framework for Combined Decision Procedures -- Connecting Many-Sorted Structures and Theories Through Adjoint Functions -- Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic -- On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal -- Interface Formalisms -- Sociable Interfaces -- Logics, Theories, and Decision Procedures II -- About the Combination of Trees and Rational Numbers in a Complete First-Order Theory -- A Complete Temporal and Spatial Logic for Distributed Systems -- Constraint Solving and Programming -- Hybrid CSP Solving -- An Efficient Decision Procedure for UTVPI Constraints -- Declarative |
|
|
|
|
|
|
|
|
|
|
Constraint Programming with Definitional Trees -- Logical Problem Analysis and Encoding I -- Logical Analysis of Hash Functions -- Combination Issues in Rewriting and Programming -- Proving and Disproving Termination of Higher-Order Functions -- Proving Liveness with Fairness Using Rewriting -- A Concurrent Lambda Calculus with Futures -- Compositional System Design and Refinement -- The ASM Method for System Design and Analysis. A Tutorial Introduction -- Logical Problem Analysis and Encoding II -- Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources -- Theorem Proving Frameworks and Systems -- Connecting a Logical Framework to a First-Order Logic Prover -- Combination of Isabelle/HOL with Automatic Tools -- ATS: A Language That Combines Programming with Theorem Proving. |
|
|
|
|
|
| |