53 citations · 201 across the 17 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs
Christian Kloimüllner, Johannes Oetsch, Jörg Pührer +1
In answer-set programming (ASP), the solutions of a problem are encoded in dedicated models, called answer sets, of a logical theory. These answer sets are computed from the progra…
Characterising equilibrium logic and nested logic programs: Reductions and complexity
David Pearce, Hans Tompits, Stefan Woltran
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of…