Scavenger 0.1: A Theorem Prover Based on Conflict Resolution

04/11/2017
by   Daniyar Itegulov, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2020

A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations

We show that Carmo and Jones' condition 5(e) conflicts with the other co...
research
06/24/2023

Categorical Approach to Conflict Resolution: Integrating Category Theory into the Graph Model for Conflict Resolution

This paper introduces the Categorical Graph Model for Conflict Resolutio...
research
09/09/2019

On CDCL-based proof systems with the ordered decision strategy

We prove that conflict-driven clause learning SAT-solvers with the order...
research
07/24/2022

State Definition for Conflict Analysis with Four-valued Logic

We examined a four-valued logic method for state settings in conflict re...
research
05/14/2014

Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R

In computational cognitive science, the cognitive architecture ACT-R is ...
research
10/31/2019

Dynamic Conflict Resolution Using Justification Based Reasoning

We study conflict situations that dynamically arise in traffic scenarios...
research
03/15/2013

Update report: LEO-II version 1.5

Recent improvements of the LEO-II theorem prover are presented. These im...

Please sign up or login with your details

Forgot password? Click here to reset