語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Frontiers of combining systems = 11t...
~
SpringerLink (Online service)
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.
團體作者:
Workshop on the Preservation of Stability under Discretization
出版者:
Cham :Springer International Publishing : : 2017.,
面頁冊數:
x, 351 p. :ill., digital ; : 24 cm.;
Contained By:
Springer eBooks
標題:
Logic, Symbolic and mathematical - Problems, exercises, etc. -
電子資源:
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 systems
11th 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 ;6140..
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:
580379
Logic, Symbolic and mathematical
--Problems, exercises, etc.
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
:02921nam a2200349 a 4500
001
923512
003
DE-He213
005
20170828154613.0
006
m d
007
cr nn 008maaau
008
190625s2017 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
Workshop on the Preservation of Stability under Discretization
$d
(2001 :
$c
Fort Collins, Colo.)
$3
527686
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 :
$c
2017.
$b
Springer International Publishing :
$b
Imprint: Springer,
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
$v
Problems, exercises, etc.
$3
580379
$3
739480
650
0
$a
Computer science
$3
675907
650
1 4
$a
Computer Science.
$3
593922
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
593924
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
670059
650
2 4
$a
Logics and Meanings of Programs.
$3
670058
650
2 4
$a
Software Engineering.
$3
669632
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
593923
650
2 4
$a
Computer Appl. in Administrative Data Processing.
$3
669633
700
1
$a
Dixon, Clare.
$3
1067089
700
1
$a
Finger, Marcelo.
$3
1199875
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
6140.
$3
744199
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-66167-4
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入