53 citations · 201 across the 17 of their papers we have counts for
18 papers
Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics
Tobias Geibinger, Hans Tompits
Paraconsistent logics constitute an important class of formalisms dealing with non-trivial reasoning from inconsistent premisses. In this paper, we introduce uniform axiomatisation…
Stepwise Debugging of Answer-Set Programs
Johannes Oetsch, Jörg Pührer, Hans Tompits
We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules. Similar to deb…
Blocked Clauses in First-Order Logic
Benjamin Kiesl, Martin Suda, Martina Seidl +2
Blocked clauses provide the basis for powerful reasoning techniques used in SAT, QBF, and DQBF solving. Their definition, which relies on a simple syntactic criterion, guarantees t…
Local Redundancy in SAT: Generalizations of Blocked Clauses
Benjamin Kiesl, Martina Seidl, Hans Tompits +1
Clause-elimination procedures that simplify formulas in conjunctive normal form play an important role in modern SAT solving. Before or during the actual solving process, such proc…
A Many-Sorted Variant of Japaridze's Polymodal Provability Logic
Gerald Berger, Lev D. Beklemishev, Hans Tompits
We consider a many-sorted variant of Japaridze's polymodal provability logic . In this variant, which is denoted , propositional variables are assi…
Modularity Aspects of Disjunctive Stable Models
Tomi Janhunen, Emilia Oikarinen, Hans Tompits +1
Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we…