![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
5th GKR 2017: Melbourne, VIC, Australia
- Madalina Croitoru, Pierre Marquis, Sebastian Rudolph
, Gem Stapleton:
Graph Structures for Knowledge Representation and Reasoning - 5th International Workshop, GKR 2017, Melbourne, VIC, Australia, August 21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10775, Springer 2018, ISBN 978-3-319-78101-3
Extended Workshop Papers
- Simon Andrews
, Simon Polovina
:
Exploring, Reasoning with and Validating Directed Graphs by Applying Formal Concept Analysis to Conceptual Graphs. 3-28 - Dave Braines
, Anna Thomas, Lance M. Kaplan, Murat Sensoy, Jonathan Z. Bakdash
, Magdalena Ivanovska, Alun D. Preece, Federico Cerutti
:
Subjective Bayesian Networks and Human-in-the-Loop Situational Understanding. 29-53 - Tanya Braun, Ralf Möller
:
Counting and Conjunctive Queries in the Lifted Junction Tree Algorithm. 54-72 - Shaun Voigt, Catherine Howard, Dean Philp, Christopher Penny:
Representing and Reasoning About Logical Network Topologies. 73-83 - Jamie Caine
, Simon Polovina
:
From Enterprise Concepts to Formal Concepts: A University Case Study. 84-96
Invited Contributions
- Gem Stapleton, Aidan J. Delaney, Michael Compton, Peter Chapman:
Visualizing ALC Using Concept Diagrams. 99-117 - Bruno Yun
, Madalina Croitoru, Srdjan Vesic, Pierre Bisquert:
Graph Theoretical Properties of Logic Based Argumentation Frameworks: Proofs and General Results. 118-138
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.