8 citations · 22 across the 7 of their papers we have counts for
8 papers
Graph-Based Orchestration of Heterogeneous AI Models: A Control Node Approach to Composite Intelligence
G. Michael Youngblood, Filip Dvořák, Slavo Švancár +3
We present a graph-based framework for Composite AI systems that integrate multiple AI techniques to address complex problems. We describe an architecture using specialized control…
Planning Domain Model Acquisition from State Traces without Action Parameters
Tomáš Balyo, Martin Suda, Lukáš Chrpa +5
Existing planning action domain model acquisition approaches consider different types of state traces from which they learn. The differences in state traces refer to the level of o…
Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Processes
Slavomír Švancár, Lukáš Chrpa, Filip Dvořák +1
The global food delivery market provides many opportunities for AI-based services that can improve the efficiency of feeding the world. This paper presents the Cloud Kitchen platfo…
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Kai Fieger, Tomas Balyo, Christian Schulz +1
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programm…
Unbounded Software Model Checking with Incremental SAT-Solving
Marko Kleine Büning, Tomas Balyo, Carsten Sinz
This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the…
Optimal Longest Paths by Dynamic Programming
Tomas Balyo, Kai Fieger, Christian Schulz
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that…
HordeQBF: A Modular and Massively Parallel QBF Solver
Tomas Balyo, Florian Lonsing
The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its…
HordeSat: A Massively Parallel Portfolio SAT Solver
Tomas Balyo, Peter Sanders, Carsten Sinz
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one s…