東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Frontiers of combining systems = 11t...

FroCoS (Symposium) (2017 :)

FindBook

Google Book

Amazon

博客來

Frontiers of combining systems = 11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Frontiers of combining systems/ edited by Clare Dixon, Marcelo Finger.
其他題名:	11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /
其他題名:	FroCoS 2017
其他作者:	Dixon, Clare.
團體作者:	FroCoS (Symposium)
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	x, 351 p. :ill., digital ;24 cm.
內容註:	Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic -- Designing Theory Solvers with Extensions -- First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation -- A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors -- Interpolation, Amalgamation and Combination (the Non-disjoint Signatures Case) -- Subtropical Satisfiability -- Finitariness of Elementary Unification in Boolean Region Connection Calculus -- Metric Temporal Description Logics with Interval-Rigid Names -- Superposition with Integrated Induction -- The Bernays-Schonfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable -- Decidable Verification of Decision-Theoretic Golog -- Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions -- Complexity Analysis for Term Rewriting by Integer Transition Systems -- Using Ontologies to Query Probabilistic Numerical Data -- Merging Fragments of Classical Logic -- On Solving Nominal Fixpoint Equations -- Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems -- Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report -- The Boolean Solution Problem from the Perspective of Predicate Logic.
Contained By:	Springer eBooks
標題:	Logic, Symbolic and mathematical - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-66167-4
ISBN:	9783319661674

Frontiers of combining systems = 11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /
Frontiers of combining systems11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /[electronic resource] :FroCoS 2017edited by Clare Dixon, Marcelo Finger. - Cham :Springer International Publishing :2017. - x, 351 p. :ill., digital ;24 cm. - Lecture notes in computer science,104830302-9743 ;. - Lecture notes in computer science ;10483..

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic -- Designing Theory Solvers with Extensions -- First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation -- A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors -- Interpolation, Amalgamation and Combination (the Non-disjoint Signatures Case) -- Subtropical Satisfiability -- Finitariness of Elementary Unification in Boolean Region Connection Calculus -- Metric Temporal Description Logics with Interval-Rigid Names -- Superposition with Integrated Induction -- The Bernays-Schonfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable -- Decidable Verification of Decision-Theoretic Golog -- Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions -- Complexity Analysis for Term Rewriting by Integer Transition Systems -- Using Ontologies to Query Probabilistic Numerical Data -- Merging Fragments of Classical Logic -- On Solving Nominal Fixpoint Equations -- Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems -- Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report -- The Boolean Solution Problem from the Perspective of Predicate Logic.

This book constitutes the proceedings of the 11th International Symposium on Frontiers of Combining Systems, FroCoS 2017, held in Brasilia, Bazil, in September 2017. The 17 papers presented in this volume were carefully reviewed and selected from 26 submissions. They were organized in topical sections named: description and temporal logics, decision procedures, decidability and verification, SAT, SMT and automated theorem proving, term rewriting, and properties and combinations of logics.

ISBN: 9783319661674

Standard No.: 10.1007/978-3-319-66167-4doiSubjects--Topical Terms:

658487
Logic, Symbolic and mathematical
--Congresses.

LC Class. No.: QA9.A1

Dewey Class. No.: 005.131

Frontiers of combining systems = 11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /
LDR:02921nmm a2200349 a 4500 001 2106154
003 DE-He213
005 20170828154613.0
006 m d
007 cr nn 008maaau
008 180417s2017 gw s 0 eng d
020 $a 9783319661674 $q (electronic bk.)
020 $a 9783319661667 $q (paper)
024 7 $a 10.1007/978-3-319-66167-4 $2 doi
035 $a 978-3-319-66167-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.A1
072 7 $a UYQ $2 bicssc
072 7 $a TJFM1 $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 005.131 $2 23
090 $a QA9.A1 $b F924 2017
111 2 $a FroCoS (Symposium) $n (11th : $d 2017 : $c Brasilia, Brazil) $3 3251736
245 1 0 $a Frontiers of combining systems $h [electronic resource] : $b 11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings / $c edited by Clare Dixon, Marcelo Finger.
246 3 $a FroCoS 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a x, 351 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10483
505 0 $a Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic -- Designing Theory Solvers with Extensions -- First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation -- A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors -- Interpolation, Amalgamation and Combination (the Non-disjoint Signatures Case) -- Subtropical Satisfiability -- Finitariness of Elementary Unification in Boolean Region Connection Calculus -- Metric Temporal Description Logics with Interval-Rigid Names -- Superposition with Integrated Induction -- The Bernays-Schonfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable -- Decidable Verification of Decision-Theoretic Golog -- Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions -- Complexity Analysis for Term Rewriting by Integer Transition Systems -- Using Ontologies to Query Probabilistic Numerical Data -- Merging Fragments of Classical Logic -- On Solving Nominal Fixpoint Equations -- Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems -- Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report -- The Boolean Solution Problem from the Perspective of Predicate Logic.
520 $a This book constitutes the proceedings of the 11th International Symposium on Frontiers of Combining Systems, FroCoS 2017, held in Brasilia, Bazil, in September 2017. The 17 papers presented in this volume were carefully reviewed and selected from 26 submissions. They were organized in topical sections named: description and temporal logics, decision procedures, decidability and verification, SAT, SMT and automated theorem proving, term rewriting, and properties and combinations of logics.
650 0 $a Logic, Symbolic and mathematical $x Congresses. $3 658487
650 0 $a Computer science $v Congresses. $3 606819
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Computer Appl. in Administrative Data Processing. $3 892567
700 1 $a Dixon, Clare. $3 2157689
700 1 $a Finger, Marcelo. $3 3251737
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10483. $3 3251738
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-66167-4
950 $a Computer Science (Springer-11645)