Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CADE
2005
Springer

favoriteEmaildiscussreport

137views Logical Reasoning» more CADE 2005»

Connecting Many-Sorted Theories

14 years 4 months ago

Connecting Many-Sorted Theories

Download lat.inf.tu-dresden.de

Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme.

Franz Baader, Silvio Ghilardi

Real-time Traffic

Automated Reasoning | Basic Connection Scheme | CADE 2005 | Component Theories | Connection Functions |

claim paper

Related Content

» Connecting ManySorted Structures and Theories Through Adjoint Functions

» Coalgebraic Components in a ManySorted Microcosm

» Random Graph Coverings I General Theory and Graph Connectivity

» A connection between cutting plane theory and the geometry of numbers

» A neural network theory of proportional analogymaking

» Information Theory The Bridge Connecting Bounded Rational Game Theory and Statistical Phy...

» Shape Connectivity Multiscale Analysis and Application to Generalized Granulometries

» Connectivity on Complete Lattices

» Virus Propagation on TimeVarying Networks Theory and Immunization Algorithms

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	CADE
Authors	Franz Baader, Silvio Ghilardi

Comments (0)