4 papers
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
Assumption-based argumentation (ABA) is a central structured argumentation formalism. As shown recently, answer set programming (ASP) enables efficiently solving NP-hard reasoning…
A Journey into Ontology Approximation: From Non-Horn to Horn
Anneke Haga, Carsten Lutz, Johannes Marti +1
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as in a Horn DL such as~. We provide concrete app…
Cautious reasoning in ASP via minimal models and unsatisfiable cores
Mario Alviano, Carmine Dodaro, Matti Järvisalo +2
Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the proposition…
Separating OR, SUM, and XOR Circuits
Magnus Find, Mika Göös, Matti Järvisalo +3
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-…