國立高雄大學圖資館 |

Language: English

Back

Frontiers of combining systems11th I...

(1998 :)

Frontiers of combining systems11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Frontiers of combining systemsedited by Clare Dixon, Marcelo Finger.
Reminder of title:	11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /
remainder title:	FroCoS 2017
other author:	Dixon, Clare.
corporate name:
Published:	Cham :Springer International Publishing :2017.
Description:	x, 351 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Logic, Symbolic and mathematical
Online resource:	http://dx.doi.org/10.1007/978-3-319-66167-4
ISBN:	9783319661674$q(electronic bk.)

Frontiers of combining systems11th 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 ;4891..

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$q(electronic bk.)

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

254195
Logic, Symbolic and mathematical

LC Class. No.: QA9.A1

Dewey Class. No.: 005.131

Frontiers of combining systems11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017 : proceedings /
LDR:02921nmm a2200349 a 4500 001 521111
003 DE-He213
005 20170828154613.0
006 m d
007 cr nn 008maaau
008 180504s2017 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 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 $3 254195
650 0 $a Computer science $3 252805
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Computer Appl. in Administrative Data Processing. $3 275283
700 1 $a Dixon, Clare. $3 727819
700 1 $a Finger, Marcelo. $3 790919
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-66167-4
950 $a Computer Science (Springer-11645)