|
|
|
|
LEADER |
03661nam a22005295i 4500 |
001 |
978-3-540-31864-4 |
003 |
DE-He213 |
005 |
20151123195156.0 |
007 |
cr nn 008mamaa |
008 |
100721s2005 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540318644
|9 978-3-540-31864-4
|
024 |
7 |
|
|a 10.1007/11532231
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TJ210.2-211.495
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TJFM1
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Automated Deduction – CADE-20
|h [electronic resource] :
|b 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005. Proceedings /
|c edited by Robert Nieuwenhuis.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
300 |
|
|
|a XIV, 466 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3632
|
505 |
0 |
|
|a What Do We Know When We Know That a Theory Is Consistent? -- Reflecting Proofs in First-Order Logic with Equality -- Reasoning in Extensional Type Theory with Equality -- Nominal Techniques in Isabelle/HOL -- Tabling for Higher-Order Logic Programming -- A Focusing Inverse Method Theorem Prover for First-Order Linear Logic -- The CoRe Calculus -- Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures -- Privacy-Sensitive Information Flow with JML -- The Decidability of the First-Order Theory of Knuth-Bendix Order -- Well-Nested Context Unification -- Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules -- The OWL Instance Store: System Description -- Temporal Logics over Transitive States -- Deciding Monodic Fragments by Temporal Resolution -- Hierarchic Reasoning in Local Theory Extensions -- Proof Planning for First-Order Temporal Logic -- System Description: Multi A Multi-strategy Proof Planner -- Decision Procedures Customized for Formal Verification -- An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic -- Connecting Many-Sorted Theories -- A Proof-Producing Decision Procedure for Real Arithmetic -- The MathSAT 3 System -- Deduction with XOR Constraints in Security API Modelling -- On the Complexity of Equational Horn Clauses -- A Combination Method for Generating Interpolants -- sKizzo: A Suite to Evaluate and Certify QBFs -- Regular Protocols and Attacks with Regular Knowledge -- The Model Evolution Calculus with Equality -- Model Representation via Contexts and Implicit Generalizations -- Proving Properties of Incremental Merkle Trees -- Computer Search for Counterexamples to Wilkie’s Identity -- KRHyper – In Your Pocket.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Nieuwenhuis, Robert.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540280057
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3632
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11532231
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|