DeepAI AI Chat
Log In Sign Up

Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

by   Maximiliano Cristiá, et al.

log ('setlog') is a satisfiability solver for formulas of the theory of finite sets and finite set relation algebra (FSTRA). As such, it can be used as an automated theorem prover (ATP) for this theory. log is able to automatically prove a number of FSTRA theorems, but not all of them. Nevertheless, we have observed that many theorems that log cannot automatically prove can be divided into a few subgoals automatically dischargeable by log. The purpose of this work is to present a prototype interactive theorem prover (ITP), called log-ITP, providing evidence that a proper integration of log into world-class ITP's can deliver a great deal of proof automation concerning FSTRA. An empirical evaluation based on 210 theorems from the TPTP and Coq's SSReflect libraries shows a noticeable reduction in the size and complexity of the proofs with respect to Coq.


page 1

page 2

page 3

page 4


An Automatically Verified Prototype of the Android Permissions System

In a previous work De Luca and Luna presented formal specifications of i...

Formalization of the Axiom of Choice and its Equivalent Theorems

In this paper, we describe the formalization of the axiom of choice and ...

{log}: Set Formulas as Programs

{log} is a programming language at the intersection of Constraint Logic ...

Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects

We present a method for using standard techniques from satisfiability ch...

The Boyer-Moore Waterfall Model Revisited

In this paper, we investigate the potential of the Boyer-Moore waterfall...

Automated Proof of Bell-LaPadula Security Properties

Almost fifty years ago, D.E. Bell and L. LaPadula published the first fo...

Automated Reasoning with Restricted Intensional Sets

Intensional sets, i.e., sets given by a property rather than by enumerat...