Search Results for author: Tomi Janhunen

Found 7 papers, 0 papers with code

Solution Enumeration by Optimality in Answer Set Programming

no code implementations7 Aug 2021 Jukka Pajunen, Tomi Janhunen

However, in this work, we generalize the enumeration of optimal answer sets beyond strictly optimal ones, giving rise to the idea of answer set enumeration in the order of optimality (ASEO).

Allen's Interval Algebra Makes the Difference

no code implementations3 Sep 2019 Tomi Janhunen, Michael Sioutis

Allen's Interval Algebra constitutes a framework for reasoning about temporal information in a qualitative manner.

Clingo goes Linear Constraints over Reals and Integers

no code implementations13 Jul 2017 Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko

The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities.

Stable-Unstable Semantics: Beyond NP with Normal Logic Programs

no code implementations5 Aug 2016 Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi

In this paper, we present a novel logic programming--based modeling paradigm that combines the best features of ASP and QBFs.

Optimizing Phylogenetic Supertrees Using Answer Set Programming

no code implementations19 Jul 2015 Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä

The supertree construction problem is about combining several phylogenetic trees with possibly conflicting information into a single tree that has all the leaves of the source trees as its leaves and the relationships between the leaves are as consistent with the source trees as possible.

Modularity Aspects of Disjunctive Stable Models

no code implementations15 Jan 2014 Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran

Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development.

Cannot find the paper you are looking for? You can Submit a new open access paper.