Sciweavers

13 search results - page 1 / 3
» Automating Signature Evolution in Logical Theories
Sort
View
CADE
2005
Springer
14 years 11 months ago
Connecting Many-Sorted Theories
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...
Franz Baader, Silvio Ghilardi
TPHOL
1997
IEEE
14 years 3 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
CADE
2008
Springer
14 years 11 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
CADE
2006
Springer
14 years 11 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...