Cover Image

Automated Deduction – CADE 26 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings /

The chapter 'Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems' is published open access under a CC BY 4.0 license.

Corporate Author: SpringerLink (Online service)
Other Authors: de Moura, Leonardo. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2017.
Edition:1st ed. 2017.
Series:Lecture Notes in Artificial Intelligence ; 10395
Subjects:
Artificial intelligence.
Mathematical logic.
Computer logic.
Software engineering.
Algorithms.
Artificial Intelligence.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Software Engineering.
Algorithm Analysis and Problem Complexity.
Online Access:https://doi.org/10.1007/978-3-319-63046-5
LEADER 02725nam a22005655i 4500
001 978-3-319-63046-5
003 DE-He213
005 20210619015952.0
007 cr nn 008mamaa
008 170710s2017 gw | s |||| 0|eng d
020 |a 9783319630465  |9 978-3-319-63046-5 
024 7 |a 10.1007/978-3-319-63046-5  |2 doi 
050 4 |a Q334-342 
072 7 |a UYQ  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
072 7 |a UYQ  |2 thema 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Automated Deduction – CADE 26  |h [electronic resource] :  |b 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings /  |c edited by Leonardo de Moura. 
250 |a 1st ed. 2017. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2017. 
300 |a XI, 582 p. 87 illus.  |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 Artificial Intelligence ;  |v 10395 
505 0 |a Automated deduction -- Including foundations -- Applications.-Implementations -- Practical experience. 
520 |a The chapter 'Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems' is published open access under a CC BY 4.0 license. 
650 0 |a Artificial intelligence. 
650 0 |a Mathematical logic. 
650 0 |a Computer logic. 
650 0 |a Software engineering. 
650 0 |a Algorithms. 
650 1 4 |a Artificial Intelligence.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I21000 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16048 
650 2 4 |a Logics and Meanings of Programs.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 
650 2 4 |a Software Engineering.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I14029 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021 
700 1 |a de Moura, Leonardo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319630458 
776 0 8 |i Printed edition:  |z 9783319630472 
830 0 |a Lecture Notes in Artificial Intelligence ;  |v 10395 
856 4 0 |u https://doi.org/10.1007/978-3-319-63046-5 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Similar Items