On combinations of local theory extensions
| dc.creator | Sofronie-Stokkermans, Viorica | |
| dc.date | 2008-10-15 | |
| dc.date.accessioned | 2026-07-07T10:10:22Z | |
| dc.date.available | 2026-07-07T10:10:22Z | |
| dc.description | 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. | |
| dc.description | 22 pages, no figure | |
| dc.identifier | https://arxiv.org/abs/0810.2653 | |
| dc.identifier | http://arxiv.org/abs/0810.2653 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171584 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.title | On combinations of local theory extensions | |
| dc.type | text |