000 04371nam a22006375i 4500
001 978-3-319-66167-4
003 DE-He213
005 20240730190114.0
007 cr nn 008mamaa
008 170828s2017 sz | s |||| 0|eng d
020 _a9783319661674
_9978-3-319-66167-4
024 7 _a10.1007/978-3-319-66167-4
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aFrontiers of Combining Systems
_h[electronic resource] :
_b11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings /
_cedited by Clare Dixon, Marcelo Finger.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aX, 351 p. 38 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v10483
505 0 _aFoundational (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-Schönfinkel-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 _aThis book constitutes the proceedings of the 11th International Symposium on Frontiers of Combining Systems, FroCoS 2017, held in Brasília, 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. The paper 'Subtropical Satisfiability' is open access under a CC BY 4.0 license via link.springer.com. .
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9141293
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aInformation technology
_xManagement.
_95368
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9141294
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Application in Administrative Data Processing.
_931588
700 1 _aDixon, Clare.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141295
700 1 _aFinger, Marcelo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141296
710 2 _aSpringerLink (Online service)
_9141297
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319661667
776 0 8 _iPrinted edition:
_z9783319661681
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v10483
_9141298
856 4 0 _uhttps://doi.org/10.1007/978-3-319-66167-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93088
_d93088