DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Abstract. The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced...
Thomas Eiter, Giovambattista Ianni, Roman Schindla...
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
Abstract. We provide uniform and invertible logical rules in a framework of relational hypersequents for the three fundamental t-norm based fuzzy logics i.e., Łukasiewicz logic, G...