Relational Characterisations of Paths
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in many areas of mathematics and computing, researchers usually f...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
11.01.2018
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.48550/arxiv.1801.04026 |
Cover
| Abstract | Binary relations are one of the standard ways to encode, characterise and
reason about graphs. Relation algebras provide equational axioms for a large
fragment of the calculus of binary relations. Although relations are standard
tools in many areas of mathematics and computing, researchers usually fall back
to point-wise reasoning when it comes to arguments about paths in a graph. We
present a purely algebraic way to specify different kinds of paths in relation
algebras. We study the relationship between paths with a designated root vertex
and paths without such a vertex. Since we stay in first-order logic this
development helps with mechanising proofs.To demonstrate the applicability of
the algebraic framework we verify the correctness of three basic graph
algorithms. All results of this paper are formally verified using the
interactive proof assistant Isabelle/HOL. |
|---|---|
| AbstractList | Binary relations are one of the standard ways to encode, characterise and
reason about graphs. Relation algebras provide equational axioms for a large
fragment of the calculus of binary relations. Although relations are standard
tools in many areas of mathematics and computing, researchers usually fall back
to point-wise reasoning when it comes to arguments about paths in a graph. We
present a purely algebraic way to specify different kinds of paths in relation
algebras. We study the relationship between paths with a designated root vertex
and paths without such a vertex. Since we stay in first-order logic this
development helps with mechanising proofs.To demonstrate the applicability of
the algebraic framework we verify the correctness of three basic graph
algorithms. All results of this paper are formally verified using the
interactive proof assistant Isabelle/HOL. |
| Author | Berghammer, Rudolf Furusawa, Hitoshi Guttmann, Walter Höfner, Peter |
| Author_xml | – sequence: 1 givenname: Rudolf surname: Berghammer fullname: Berghammer, Rudolf – sequence: 2 givenname: Hitoshi surname: Furusawa fullname: Furusawa, Hitoshi – sequence: 3 givenname: Walter surname: Guttmann fullname: Guttmann, Walter – sequence: 4 givenname: Peter surname: Höfner fullname: Höfner, Peter |
| BackLink | https://doi.org/10.48550/arXiv.1801.04026$$DView paper in arXiv |
| BookMark | eNrjYmDJy89LZWCQNDTQM7EwNTXQTyyqyCzTM7QwMNQzMDEwMuNkUA1KzUksyczPS8xRcM5ILEpMLkktyiwGCxUr5KcpBCSWZBTzMLCmJeYUp_JCaW4GeTfXEGcPXbCB8QVFmbmJRZXxIIPjwQYbE1YBABwQLpA |
| ContentType | Journal Article |
| Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| DBID | AKY GOX |
| DOI | 10.48550/arxiv.1801.04026 |
| DatabaseName | arXiv Computer Science arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 1801_04026 |
| GroupedDBID | AKY GOX |
| ID | FETCH-arxiv_primary_1801_040263 |
| IEDL.DBID | GOX |
| IngestDate | Wed Jul 23 02:02:06 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-arxiv_primary_1801_040263 |
| OpenAccessLink | https://arxiv.org/abs/1801.04026 |
| ParticipantIDs | arxiv_primary_1801_04026 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-01-11 |
| PublicationDateYYYYMMDD | 2018-01-11 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-01-11 day: 11 |
| PublicationDecade | 2010 |
| PublicationYear | 2018 |
| Score | 3.2930079 |
| SecondaryResourceType | preprint |
| Snippet | Binary relations are one of the standard ways to encode, characterise and
reason about graphs. Relation algebras provide equational axioms for a large
fragment... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Logic in Computer Science |
| Title | Relational Characterisations of Paths |
| URI | https://arxiv.org/abs/1801.04026 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQSTQ0SjU1TEnSTbQAFoHAGsNAN8nAJAUYIUbJJibGackGqaCNwr5-Zh6hJl4RphFMDAqwvTCJRRWZZZDzgZOK9Q0tQEdqArs4ZswMzMCGAmgzr38EZHISfBQXVD1CHbCNCRZCqiTcBBn4oa07BUdIdAgxMKXmiTCowhacAWWcEecjQ4bKFPLTFAKArbBiUQZ5N9cQZw9dsMHxBZBTIOJBdsaD7TQWY2AB9tVTJRgUTFMNLEySjQzSgJ1OkzSjJIvkVPM0U8Nk0GanZGNjI0kGCVymSOGWkmbgAtbToEVnuoaGMgwsJUWlqbLAurAkSQ4cIAC5c2I0 |
| linkProvider | Cornell University |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Relational+Characterisations+of+Paths&rft.au=Berghammer%2C+Rudolf&rft.au=Furusawa%2C+Hitoshi&rft.au=Guttmann%2C+Walter&rft.au=H%C3%B6fner%2C+Peter&rft.date=2018-01-11&rft_id=info:doi/10.48550%2Farxiv.1801.04026&rft.externalDocID=1801_04026 |