Computer Science – Logic in Computer Science
Scientific paper
2008-10-15
Computer Science
Logic in Computer Science
22 pages, no figure
Scientific paper
In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is possible, and give several examples from computer science and mathematics in which such extensions occur in a natural way. We then identify situations in which combinations of local extensions of a theory are again local extensions of that theory. We thus obtain criteria both for recognizing wider classes of local theory extensions, and for modular reasoning in combinations of theories over non-disjoint signatures.
No associations
LandOfFree
On combinations of local theory extensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On combinations of local theory extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On combinations of local theory extensions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-302920