Frontiers of combining systems 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings /
This 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 sectio...
| Corporate Authors: | FroCoS (Symposium) Brasília, Brazil) |
|---|---|
| Other Authors: | FroCoS (Symposium), Dixon, Clare,, Finger, Marcelo,, SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Cham, Switzerland :
Springer,
2017.
|
| Physical Description: |
1 online resource (x, 351 pages) : illustrations. |
| Series: |
Lecture notes in computer science ;
10483. Lecture notes in computer science. Lecture notes in artificial intelligence. LNCS sublibrary. Artificial intelligence. |
| Subjects: |
Table of Contents:
- 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-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.