Scavenger 0.1: A theorem prover based on conflict resolution

Daniyar Itegulov, John Slaney, Bruno Woltzenlogel Paleo*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Citation (Scopus)

    Abstract

    This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus. Conflict resolution has a restricted resolution inference rule that resembles (a first-order generalization of) unit propagation as well as a rule for assuming decision literals and a rule for deriving new clauses by (a first-order generalization of) conflict-driven clause learning.

    Original languageEnglish
    Title of host publicationAutomated Deduction
    Subtitle of host publicationCADE 26 - 26th International Conference on Automated Deduction, Proceedings
    EditorsLeonardo de Moura
    PublisherSpringer Verlag
    Pages345-356
    Number of pages12
    ISBN (Print)9783319630458
    DOIs
    Publication statusPublished - 2017
    Event26th International Conference on Automated Deduction, CADE-26 2017 - Gothenburg, Sweden
    Duration: 6 Aug 201711 Aug 2017

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10395 LNAI
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference26th International Conference on Automated Deduction, CADE-26 2017
    Country/TerritorySweden
    CityGothenburg
    Period6/08/1711/08/17

    Fingerprint

    Dive into the research topics of 'Scavenger 0.1: A theorem prover based on conflict resolution'. Together they form a unique fingerprint.

    Cite this