• Deutsch
Login
Hochschule Bonn-Rhein-Sieg

Open Access

  • Home
  • Search
  • Browse
  • Publish
  • Help

Refine

Department, Institute

  • Fachbereich Informatik (2)
  • Institute of Visual Computing (IVC) (1)

Keywords

  • Datalog (1)
  • Grailog (1)
  • JavaScript (1)
  • RuleML (1)
  • SVG (1)
  • Visualization (1)
  • XML (1)
  • XSLT (1)
  • computational logic (1)
  • directed hypergraphs (1)
  • graphs (1)
  • rules (1)
- less

2 search hits

  • 1 to 2
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Grailog KS Viz: A Grailog Visualizer for Datalog RuleML Using an XSLT Translator to SVG (2013)
Koch, Martin ; Schmidt, Sven ; Boley, Harold ; Herpers, Rainer
Grailog embodies a systematics to visualize knowledge sources by graphical elements. Its main benefit is that the resulting visual presentations are easier to read for humans than the original symbolic source code. In this paper we introduce a methodology to handle the mapping from Datalog RuleML, serialized in XML, to an SVG representation of Grailog, also serialized in XML, via eXtensible Stylesheet Language Transformations (XSLT) 2.0/XML; the SVG is then rendered visually by modern Web browsers. This initial mapping is realized to target Grailog's "fully node copied" normal form. Elements can thus be translated one at a time, separating the fundamental Datalog-to-SVG translation concern from the concern of merging node copies for optimal (hyper)graph layout and avoiding its high computational complexity in this online tool. The resulting open source Grailog Knowledge-Source Visualizer (Grailog KS Viz) supports Datalog RuleML with positional relations of arity n>1. The on-the-fly transformation was shown to run on all recent major Web browsers and should be easy to understand, use, and extend.
Improved tree-based strategies for a Connect6 threat-based hardware design (2013)
Koch, Martin ; Schmidt, Sven ; Herpers, Rainer ; Kent, Kenneth B.
Connect6 is a member of the k-in-a-row games family and attracts attention through its fairness and game complexity. Several very good strategies for Connect6 exist. In this paper we improve an already existing threat-based hardware design, which only evaluates the actual allocation of the game board. This strategy calculates a best move and waits until it wins or loses in the next two moves after the actual state. Our new proposed strategies think ahead and try to advance the player into a better position for the subsequent moves. We implemented three strategies with different winning chances, but all with clear advantages against the original strategy. This could be achieved without a much longer time for calculation and without the need of much more memory capacity. The implementations are validated on an Altera DE2 board, which contains a Cyclone II field-programmable gate array.
  • 1 to 2

OPUS4 Logo

  • Contact
  • Imprint and Privacy policy (in German)
  • Sitelinks