rover_prover 0.1.0

data/lib/rover_prover/prover/unifier.rb

@@ -0,0 +1,29 @@
+require 'pry'
+class Unifier
+
+  def unify_all(pairs_list)
+    lengths = pairs_list.map { |pair| (0..(pair.length - 1)).to_a }
+    first = lengths.shift
+    indexes = first.product(*lengths)
+    indexes.each do |index|
+      possible_pairs = pairs_list.map.with_index { |pairs, i| pairs[index[i]] }
+      subst = unify_list(possible_pairs)
+      return subst unless subst.nil?
+    end
+    nil
+  end
+
+  def unify_list(pairs)
+    substitution = {}
+    pairs.each do |a, b|
+      substitution.each do |k, v|
+        a = a.replace(k, v)
+        b = b.replace(k, v)
+      end
+      sub = a.unify(b)
+      return nil if sub.nil?
+      substitution.merge!(sub)
+    end
+    substitution
+  end
+end

data/lib/rover_prover/version.rb

@@ -0,0 +1,3 @@
+module RoverProver
+  VERSION = "0.1.0"
+end

data/lib/rover_prover.rb

@@ -0,0 +1,111 @@
+require_relative 'rover_prover/processor/processor.rb'
+require_relative 'rover_prover/prover/prover.rb'
+require 'pry'
+
+module RoverProver
+  module Main
+    def self.run
+      message = <<~MSG
+        Rover: First-Order Logic Theorem Prover
+        2019 Koki Ryu
+        2014 Stephan Boyer
+        Terms:
+
+          x               (variable)
+          f(term, ...)    (function)
+
+        Formulae:
+
+          P(term)        (predicate)
+          not P          (complement)
+          P or Q         (disjunction)
+          P and Q        (conjunction)
+          P implies Q    (implication)
+          forall x. P    (universal quantification)
+          exists x. P    (existential quantification)
+
+        Enter formulae at the prompt. The following commands are also available for manipulating axioms:
+
+          axioms              (list axioms)
+          lemmas              (list lemmas)
+          axiom <formula>     (add an axiom)
+          lemma <formula>     (prove and add a lemma)
+          remove <formula>    (remove an axiom or lemma)
+          reset               (remove all axioms and lemmas)
+
+        Enter 'exit' command to exit the prompt.
+      MSG
+
+      puts message
+
+      axioms = []
+      lemmas = {}
+
+      prover = Prover.new
+
+      while true do
+        begin
+          print("\nRover> ")
+          cmd = gets
+          if cmd.nil?
+            puts 'Bye'
+            return
+          end
+          cmd_token = RoverParser.parse(RoverLexer.lex(cmd))
+          if cmd_token.is_a?(Axioms)
+            axioms.each { |axiom| puts axiom.to_s }
+          elsif cmd_token.is_a?(Lemmas)
+            lemmas.keys.each { |lemma| puts lemma.to_s }
+          elsif cmd_token.is_a?(Axiom)
+            axioms.push(cmd_token.formula)
+            puts "Axiom added: #{cmd_token.formula.to_s}"
+          elsif cmd_token.is_a?(Lemma)
+            result = prover.prove_formula(axioms | lemmas.keys, cmd_token.formula)
+            if result
+              lemmas[cmd_token.formula] = axioms.dup
+              puts "Lemma proven: #{cmd_token.formula.to_s}"
+            else
+              puts "Lemma unprovable: #{cmd_token.formula.to_s}"
+            end
+          elsif cmd_token.is_a?(Remove)
+            result = axioms.reject! { |axiom| axiom.eql?(cmd_token.formula) }
+            if result.nil?
+              puts "Not an axiom: #{cmd_token.formula.to_s}"
+            else
+              puts "Axiom removed: #{cmd_token.formula.to_s}"
+              bad_lemmas = lemmas.keys.select { |key| lemmas[key].any?{ |lemma| lemma.eql?(cmd_token.formula) } }
+              puts "Dependent axioms are also removed:"
+              bad_lemmas.each do |lemma|
+                lemmas.delete(lemma)
+                puts lemma.to_s
+              end
+            end
+          elsif cmd_token.is_a?(Reset)
+            axioms = []
+            lemmas = {}
+          elsif cmd_token.is_a?(Exit)
+            puts 'Bye'
+            return
+          else
+            result = prover.prove_formula(axioms | lemmas.keys, cmd_token)
+            if result
+              puts "Formula proven: #{cmd_token.to_s}"
+            else
+              puts "Formula unprovable: #{cmd_token.to_s}"
+            end
+          end
+
+
+        rescue Interrupt
+          next
+        rescue RLTK::LexingError => e
+          puts "Error: Unable to parse #{e.remainder}"
+          next
+        rescue RLTK::NotInLanguage
+          puts 'Error: Invalid command'
+          next
+        end
+      end
+    end
+  end
+end

data/rover_prover.gemspec

@@ -0,0 +1,28 @@
+lib = File.expand_path("../lib", __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "rover_prover/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "rover_prover"
+  spec.version       = RoverProver::VERSION
+  spec.authors       = ["Koki Ryu"]
+  spec.email         = ["liukoki@gmail.com"]
+
+  spec.summary       = %q{First-Order Logic Theorem Prover}
+  spec.homepage      = "https://github.com/liwii"
+  spec.license       = "MIT"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 2.0"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec"
+  spec.add_runtime_dependency "rltk"
+end

metadata

@@ -0,0 +1,138 @@
+--- !ruby/object:Gem::Specification
+name: rover_prover
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Koki Ryu
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2019-06-24 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rltk
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: 
+email:
+- liukoki@gmail.com
+executables:
+- rover_prover
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- exe/rover_prover
+- lib/rover_prover.rb
+- lib/rover_prover/language.rb
+- lib/rover_prover/language/expression.rb
+- lib/rover_prover/language/formula.rb
+- lib/rover_prover/language/formula/and.rb
+- lib/rover_prover/language/formula/for_all.rb
+- lib/rover_prover/language/formula/formulae.rb
+- lib/rover_prover/language/formula/implies.rb
+- lib/rover_prover/language/formula/not.rb
+- lib/rover_prover/language/formula/or.rb
+- lib/rover_prover/language/formula/predicate.rb
+- lib/rover_prover/language/formula/there_exists.rb
+- lib/rover_prover/language/sequent.rb
+- lib/rover_prover/language/term.rb
+- lib/rover_prover/language/term/function.rb
+- lib/rover_prover/language/term/terms.rb
+- lib/rover_prover/language/term/unification_term.rb
+- lib/rover_prover/language/term/variable.rb
+- lib/rover_prover/processor/commands.rb
+- lib/rover_prover/processor/processor.rb
+- lib/rover_prover/processor/rover_lexer.rb
+- lib/rover_prover/processor/rover_parser.rb
+- lib/rover_prover/prover/prover.rb
+- lib/rover_prover/prover/unifier.rb
+- lib/rover_prover/version.rb
+- logo.png
+- rover_prover.gemspec
+homepage: https://github.com/liwii
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.1
+signing_key: 
+specification_version: 4
+summary: First-Order Logic Theorem Prover
+test_files: []