satre 0.1.0

data/lib/satre/formula/or.rb

@@ -0,0 +1,25 @@
+require 'satre/formula'
+
+module Satre
+  class Or < Formula
+    attr_reader :p
+    attr_reader :q
+
+    def initialize(p,q)
+      fail(ArgumentError, 'Argument must be a Formula') unless p.is_a?(Formula)
+      fail(ArgumentError, 'Argument must be a Formula') unless q.is_a?(Formula)
+      @p = p.dup.freeze
+      @q = q.dup.freeze
+      super "(#{@p} ∨ #{@q})"
+    end
+
+    def eval(valudation)
+      p.eval(valudation) or q.eval(valudation)
+    end
+
+    def atoms
+      atoms = p.atoms + q.atoms
+      atoms.uniq || []
+    end
+  end
+end

data/lib/satre/formula/true.rb

@@ -0,0 +1,17 @@
+require 'satre/formula'
+
+module Satre
+  class True < Formula
+    def initialize
+      super '⊤'
+    end
+
+    def eval(*)
+      true
+    end
+
+    def atoms
+      []
+    end
+  end
+end

data/lib/satre/formula_parser.rb

@@ -0,0 +1,92 @@
+require 'satre/formula'
+
+module Satre
+  class FormulaParser < Parser
+    class << self
+
+      def parse_formula
+        lambda do |inp|
+          e1, i1 = parse_imp(inp)
+          if i1[0] == '|='
+            e2, i2 = parse_formula.call(i1.drop(1))
+            return Entails.new(e1,e2), i2
+          end
+          return e1, i1
+        end
+      end
+
+      def parse_imp(inp)
+        e1, i1 = parse_iff(inp)
+        if i1[0] == '=>'
+          e2, i2 = parse_formula.call(i1.drop(1))
+          return Imp.new(e1,e2), i2
+        end
+        return e1, i1
+      end
+      
+      def parse_not(inp)
+        if inp.first == '~'
+          e1, i1 = parse_atom(inp.drop(1))
+          return Not.new(e1), i1
+        else
+          e1, i1 = parse_atom(inp)
+          return e1, i1
+        end
+      end
+
+      def parse_and(inp)
+        e1, i1 = parse_or(inp)
+        if i1[0] == '/\\'
+          e2, i2 = parse_formula.call(i1.drop(1))
+          return And.new(e1,e2), i2
+        end
+        return e1, i1
+      end
+
+      def parse_or(inp)
+        e1, i1 = parse_not(inp)
+        if i1[0] == '\\/'
+          e2, i2 = parse_formula.call(i1.drop(1))
+          return Or.new(e1, e2), i2
+        end
+        return e1, i1
+      end
+
+      def parse_iff(inp)
+        e1, i1 = parse_and(inp)
+        if i1[0] == '<=>'
+          e2, i2 = parse_formula.call(i1.drop(1))
+          return Iff.new(e1, e2), i2
+        end
+        return e1, i1
+      end
+
+      def parse_atom(inp)
+        fail(ArgumentError, 'Expected an expression at end of input') if inp == []
+        if inp[0] == '('
+          e2, i2 = parse_formula.call(inp.drop(1))
+          if i2[0] == ')'
+            return e2, i2.drop(1)
+          else
+            fail(ExpressionError, 'Expected closing bracket')
+          end
+        else
+          return False.new, inp.drop(1) if inp[0] == "False"
+          return True.new, inp.drop(1) if inp[0] == "True"
+          return Atom.new(inp[0]), inp.drop(1)
+        end
+      end
+
+      def parse(inp)
+        make_parser.curry.call(parse_formula).call(inp)
+      end
+
+    end
+  end
+end
+
+class String
+  def to_formula
+    Satre::FormulaParser.parse(self)
+  end
+end

data/lib/satre/lexer.rb

@@ -0,0 +1,47 @@
+module Satre
+  class Lexer
+    class << self
+      def matches
+        lambda { |pattern, str| str.split("").all? { |c| pattern.include? c } }
+      end
+
+      def space?
+        self.matches.curry.call(" \t\n\r").dup.freeze
+      end
+
+      def punctuation?
+        self.matches.curry.call("()[]{}").dup.freeze
+      end
+
+      def symbolic?
+        self.matches.curry.call("~`!@#%$^&*-+<=>\\/|").dup.freeze
+      end
+
+      def numeric?
+        self.matches.curry.call("0123456789").dup.freeze
+      end
+
+      def alpanumeric?
+        self.matches.curry.call("abcdefghijklmnopqrstuvwxyz_'ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789").dup.freeze
+      end
+
+      def lexwhile(prop, inp)
+        tokl = inp.split("").take_while { |c| prop.call(c) }.inject(:+)
+        tokl = "" if tokl.nil?
+        return tokl, inp[tokl.length..-1]
+      end
+
+      def lex(inp)
+        inp, rest = self.lexwhile(self.space?, inp)
+        return [] if rest == "" || rest.nil?
+        c = rest[0]
+        cs = rest[1..-1]
+        prop =  if self.alpanumeric?.call(c) then self.alpanumeric?
+                elsif self.symbolic?.call(c) then self.symbolic?
+                else proc { false } end
+        toktl, rest = self.lexwhile prop, cs
+        [c+toktl] + lex(rest)
+      end
+    end
+  end
+end

data/lib/satre/parser.rb

@@ -0,0 +1,15 @@
+require 'satre/lexer'
+
+module Satre
+  class Parser
+    class << self
+      def make_parser
+        lambda do |pfn, inp|
+          expr, rest = pfn.call(Lexer.lex(inp))
+          return expr if rest == []
+          fail(ParserError, 'Unparsed input')
+        end
+      end
+    end
+  end
+end

data/lib/satre/version.rb

@@ -0,0 +1,3 @@
+module Satre
+  VERSION = '0.1.0'
+end

data/satre.gemspec

@@ -0,0 +1,40 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'satre/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'satre'
+  spec.version       = Satre::VERSION
+  spec.authors       = ['Roman C. Podolski']
+	spec.email         = ['roman.podolski@tum.de']
+
+  spec.summary       = %q{A propositional and first order logic library}
+  spec.description   = %q{
+  I think therefore I am.
+  
+  Satre is a library for proportional and first order logic.
+  It was inspired by the book 'Handbook of practical logic and automated reasoning' by Harrison, J (2009).
+  
+  This project originated at the Technical university munich as a students project in the lecture 'Basics of Artificial Intelligence'.
+  }
+  spec.homepage      = "http://in.tum.de"
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = 'exe'
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  spec.add_runtime_dependency 'terminal-table'
+  spec.add_development_dependency 'bundler', '~> 1.10'
+  spec.add_development_dependency 'guard-bundler'
+  spec.add_development_dependency 'minitest'
+  spec.add_development_dependency 'simplecov'
+  spec.add_development_dependency 'guard-minitest'
+  spec.add_development_dependency 'rake', '~> 10.0'
+  spec.add_development_dependency 'rspec'
+  spec.add_development_dependency 'pry'
+  spec.add_development_dependency 'rubocop'
+  spec.add_development_dependency 'guard-rubocop'
+end

metadata

@@ -0,0 +1,239 @@
+--- !ruby/object:Gem::Specification
+name: satre
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Roman C. Podolski
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-01-10 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: terminal-table
+  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'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  name: guard-bundler
+  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: minitest
+  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: simplecov
+  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: guard-minitest
+  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: 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: pry
+  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: rubocop
+  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: guard-rubocop
+  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'
+description: "\n  I think therefore I am.\n  \n  Satre is a library for proportional
+  and first order logic.\n  It was inspired by the book 'Handbook of practical logic
+  and automated reasoning' by Harrison, J (2009).\n  \n  This project originated at
+  the Technical university munich as a students project in the lecture 'Basics of
+  Artificial Intelligence'.\n  "
+email:
+- roman.podolski@tum.de
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- Guardfile
+- LICENSE
+- README.md
+- Rakefile
+- bin/console
+- bin/exercise
+- bin/setup
+- lib/satre.rb
+- lib/satre/expression.rb
+- lib/satre/expression/add.rb
+- lib/satre/expression/const.rb
+- lib/satre/expression/expression.rb
+- lib/satre/expression/expression_parser.rb
+- lib/satre/expression/mul.rb
+- lib/satre/expression/var.rb
+- lib/satre/formula.rb
+- lib/satre/formula/and.rb
+- lib/satre/formula/atom.rb
+- lib/satre/formula/entails.rb
+- lib/satre/formula/false.rb
+- lib/satre/formula/formula.rb
+- lib/satre/formula/iff.rb
+- lib/satre/formula/imp.rb
+- lib/satre/formula/not.rb
+- lib/satre/formula/or.rb
+- lib/satre/formula/true.rb
+- lib/satre/formula_parser.rb
+- lib/satre/lexer.rb
+- lib/satre/parser.rb
+- lib/satre/version.rb
+- satre.gemspec
+homepage: http://in.tum.de
+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: []
+rubyforge_project: 
+rubygems_version: 2.4.6
+signing_key: 
+specification_version: 4
+summary: A propositional and first order logic library
+test_files: []
+has_rdoc: