Abstract
The Craig Interpolation Theorem can be viewed as saying that in first order logic, two agents who can only communicate in their common language can cooperate in building proofs. We obtain generalizations of the Craig Interpolation Theorem for finite sets of agents with the following properties. (1) The agents are vertices of a directed graph. (2) The agents have knowledge bases with overlapping signatures. (3) The agents can only communicate by sending to neighboring agents sentences that they know and that are in the common language of the two agents.
| Original language | English |
|---|---|
| Pages (from-to) | 1322-1344 |
| Number of pages | 23 |
| Journal | Annals of Pure and Applied Logic |
| Volume | 163 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2012 |
ASJC Scopus Subject Areas
- Logic
Keywords
- Craig interpolation
- Knowledge base
- Network
- Partition based reasoning
- Peer-to-peer inference
Fingerprint
Dive into the research topics of 'Craig interpolation for networks of sentences'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS