3 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
SAT Solving for Variants of First-Order Subsumption
Robin Coutelier, Jakob Rath, Michael Rawson +2
Automated reasoners, such as SAT/SMT solvers and first-order provers, are becoming the backbones of rigorous systems engineering, being used for example in applications of system v…
SAT-Based Subsumption Resolution
Robin Coutelier, Laura Kovács, Michael Rawson +1
Subsumption resolution is an expensive but highly effective simplifying inference for first-order saturation theorem provers. We present a new SAT-based reasoning technique for sub…
Subsumption Demodulation in First-Order Theorem Proving
Bernhard Gleiss, Laura Kovacs, Jakob Rath
Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning…
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Mario Alviano, Carmine Dodaro, Johannes K. Fichte +3
Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer…