國立高雄大學圖資館 |

Language: English

Back

Frontiers of combining systems13th I...

(1998 :)

Frontiers of combining systems13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Frontiers of combining systemsedited by Boris Konev, Giles Reger.
Reminder of title:	13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings /
remainder title:	FroCoS 2021
other author:	Konev, Boris.
corporate name:
Published:	Cham :Springer International Publishing :2021.
Description:	xvi, 307 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Logic, Symbolic and mathematical
Online resource:	https://doi.org/10.1007/978-3-030-86205-3
ISBN:	9783030862053

Frontiers of combining systems13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings /
Frontiers of combining systems13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings /[electronic resource] :FroCoS 2021edited by Boris Konev, Giles Reger. - Cham :Springer International Publishing :2021. - xvi, 307 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,129410302-9743 ;. - Lecture notes in computer science ;4891..

Calculi and Unification -- A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic -- Non-Disjoint Combined Unification and Closure by Equational Paramodulation -- Symbol Elimination and Applications to Parametric Entailment Problems -- On the copy complexity of width 3 Horn constraint systems -- Description Logics Restricted Unification in the Description Logic FL0 -- Combining Event Calculus and Description Logic Reasoning via Logic Programming -- Semantic Forgetting in Expressive Description Logics -- Interactive Theorem Proving Improving Automation for Higher-order Proof Steps -- JEFL: Joint Embedding of Formal Proof Libraries -- Machine Learning Fast and Slow Enigmas and Parental Guidance -- Vampire With a Brain Is a Good ITP Hammer -- Satisfiability Modulo Theories Optimization Modulo Non-Linear Arithmetic via Incremental Linearization -- Quantifier Simplification by Unification in SMT -- Verification Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems -- Formal Analysis of Symbolic Authenticity -- Formal Verification of a Java Component Using the RESOLVE Framework.

This book constitutes the refereed proceedings of the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021, held in Birmingham, UK, in September 2021.

ISBN: 9783030862053

Standard No.: 10.1007/978-3-030-86205-3doiSubjects--Topical Terms:

254195
Logic, Symbolic and mathematical

LC Class. No.: QA9.A1 / F76 2021

Dewey Class. No.: 005.131

Frontiers of combining systems13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings /
LDR:02578nmm a2200361 a 4500 001 607883
003 DE-He213
005 20210831090351.0
006 m d
007 cr nn 008maaau
008 220119s2021 sz s 0 eng d
020 $a 9783030862053 $q (electronic bk.)
020 $a 9783030862046 $q (paper)
024 7 $a 10.1007/978-3-030-86205-3 $2 doi
035 $a 978-3-030-86205-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.A1 $b F76 2021
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA9.A1 $b F924 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Frontiers of combining systems $h [electronic resource] : $b 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings / $c edited by Boris Konev, Giles Reger.
246 3 $a FroCoS 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvi, 307 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12941
490 1 $a Lecture notes in artificial intelligence
505 0 $a Calculi and Unification -- A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic -- Non-Disjoint Combined Unification and Closure by Equational Paramodulation -- Symbol Elimination and Applications to Parametric Entailment Problems -- On the copy complexity of width 3 Horn constraint systems -- Description Logics Restricted Unification in the Description Logic FL0 -- Combining Event Calculus and Description Logic Reasoning via Logic Programming -- Semantic Forgetting in Expressive Description Logics -- Interactive Theorem Proving Improving Automation for Higher-order Proof Steps -- JEFL: Joint Embedding of Formal Proof Libraries -- Machine Learning Fast and Slow Enigmas and Parental Guidance -- Vampire With a Brain Is a Good ITP Hammer -- Satisfiability Modulo Theories Optimization Modulo Non-Linear Arithmetic via Incremental Linearization -- Quantifier Simplification by Unification in SMT -- Verification Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems -- Formal Analysis of Symbolic Authenticity -- Formal Verification of a Java Component Using the RESOLVE Framework.
520 $a This book constitutes the refereed proceedings of the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021, held in Birmingham, UK, in September 2021.
650 0 $a Logic, Symbolic and mathematical $3 254195
650 0 $a Computer science $3 252805
650 1 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
700 1 $a Konev, Boris. $3 905023
700 1 $a Reger, Giles. $3 792617
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Lecture notes in artificial intelligence. $3 822012
856 4 0 $u https://doi.org/10.1007/978-3-030-86205-3
950 $a Computer Science (SpringerNature-11645)