rbprolog 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 6af2d1c30e5537ecd0129fb9ff8ec732751091c2
+  data.tar.gz: fdb511793cdaa753e458f6c7629209f0c1a9744a
+SHA512:
+  metadata.gz: 8e9cb8fa7831f2b504b440b2a31ccc2f4a14c0db2ac1e5380af7079d46b14d09d8cc5cec21db243e19eb57f17fb3666a6a94ec1074fb64f822fd216e346eff43
+  data.tar.gz: 61703cdc1663c95c817dd7ebc032712c701b8c12fb1180e1b907ae13a546d9aeedc5d1e0c422078c8f163caa6f4dab47ed07ecba27871d6c3015e7aa1c0364c9

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in rbprolog.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 RUIJIA LI
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,54 @@
+# Rbprolog
+
+The gem simulates logic processing functionality of prolog. It uses DSL style and only provides limited features now.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'rbprolog'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install rbprolog
+
+## Usage
+
+* Include Rbprolog and describe the facts and rules
+
+```ruby
+class FriendLogic
+  include Rbprolog
+
+  keywords :likes, :friends
+
+  likes 'p1', 's1'
+  likes 'p1', 's2'
+  likes 'p2', 's2'
+  likes 'p3', 's1'
+  likes 'p4', X
+
+  friends 'p1', W, :if => likes?(W, 's2')
+  friends X, Y, :if => [likes?(X, Z), likes?(Y, Z)]
+end
+```
+
+* Instance the class to question
+
+```ruby
+l = FriendLogic.new
+l.likes?('p1', 's1') #=> true
+l.friends?('p1', 'p4') #=> true
+```
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,4 @@
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+Rake::TestTask.new

data/lib/rbprolog/context.rb

@@ -0,0 +1,53 @@
+module Rbprolog
+  class Context
+    attr_accessor :binds
+
+    def match?(v1, v2)
+      v1 = deduce(v1)
+      Var === v1 || Var === v2 || v1 == v2
+    end
+
+    def match!(v1, v2)
+      if match?(v1, v2)
+        if Var === v1 && !(Var === v2)
+          @binds[v1.sym] = v2
+        # elsif Var === v2 && !(Var === v1)
+          # @binds[v2.sym] = v1
+        end
+
+        true
+      else
+        false
+      end
+    end
+
+    def deduce(v)
+      if Var === v
+        unless @binds[v.sym]
+          @stacks.last << v.sym
+          @binds[v.sym] = Var.new(v.sym)
+        end
+
+        @binds[v.sym]
+      else
+        v
+      end
+    end
+
+    def scope(predicate, &block)
+      @stacks ||= []
+      @stacks.push([])
+
+      @binds ||= {}
+
+      mirror = @binds.clone
+
+      result = yield
+
+      @stacks.pop.each {|bind| @binds.delete bind}
+      @binds.merge!(mirror)
+
+      result
+    end
+  end
+end

data/lib/rbprolog/deduction.rb

@@ -0,0 +1,42 @@
+module Rbprolog
+  class Deduction
+    include Enumerable
+    attr_accessor :args, :sym
+
+    def initialize(logic, sym, *args)
+      @logic = logic
+      @sym = sym
+
+      @args = args
+    end
+
+    def each
+      each_deduce(Context.new, @logic.rules, "", []) do |hash|
+        yield hash
+      end
+    end
+
+    def each_deduce(context, rules, tabs, id)
+      print "#{tabs}#{id.join('.')} #{@sym}?(#{@args.map(&:to_s).join(', ')})"
+
+      rules.select {|rule| rule.sym == @sym}.each_with_index do |rule, i|
+        context.scope(self) do
+          puts " => #{@sym}?(#{@args.map {|arg| context.deduce(arg).to_s}.join(', ')})" if i == 0 #{context.to_s} #{context.binds.inspect}" if i == 0
+
+          rule.each_deduce(rules, *@args.map {|arg| context.deduce(arg)}, tabs + "\t", id + [i]) do |hash|
+            context.scope(self) do
+              rule.args.each_with_index do |rule_arg, rule_arg_index|
+                deduced_arg = context.deduce(@args[rule_arg_index])
+                if Var === deduced_arg
+                  context.binds[deduced_arg.sym] = Var === rule_arg ? hash[rule_arg.sym] : rule_arg
+                end
+              end
+
+              yield context.binds
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/lib/rbprolog/rule.rb

@@ -0,0 +1,59 @@
+module Rbprolog
+
+  #when fail at one predicate, the output values need be reset, and remove from the parent rule/s context
+  class Rule
+    attr_accessor :args, :sym
+
+    def initialize(sym, *args, predicates)
+      @sym = sym
+      @args = args
+      @predicates = [predicates].flatten
+    end
+
+    def each_deduce(rules, *args, tabs, id)
+      print "#{tabs}#{id.join('.')} #{@sym}(#{@args.map(&:to_s).join(', ')}).deduce(#{args.map(&:to_s).join(', ')})"
+
+      context = Context.new
+      context.scope(self) do
+        if self.match!(context, args)
+          puts " => #{@sym}(#{@args.map {|arg| context.deduce(arg).to_s}.join(', ')})" #{context.to_s} #{context.binds.inspect}"
+          deduce_predicates(context, rules, *@predicates, tabs, id) do
+            yield context.binds
+          end
+        else
+          print "\n"
+        end
+      end
+    end
+
+    def deduce_predicates(context, rules, *predicates, tabs, id, &block)
+      if predicates.empty?
+        yield
+      else
+        predicate = predicates.shift
+        if Deduction === predicate
+          predicate.each_deduce(context, rules, tabs + "\t", id + [@predicates.size - predicates.size - 1]) do |hash|
+            deduce_predicates(context, rules, *predicates, tabs, id, &block)
+          end
+        else
+          @logic.send(:define_singleton_method, :const_missing) do |sym|
+            context.binds[sym]
+          end
+
+          predicate.call && deduce_predicates(context, rules, *predicates, tabs, id, &block)
+        end
+
+      end
+    end
+
+    def match?(context, args)
+      @args.size == args.size && @args.zip(args).all? {|v1, v2| context.match?(v1, v2)}
+    end
+
+    def match!(context, args)
+      match = match?(context, args)
+      @args.zip(args).each {|v1, v2| context.match!(v1, v2)} if match
+      match
+    end
+  end
+end

data/lib/rbprolog/var.rb

@@ -0,0 +1,17 @@
+module Rbprolog
+  class Var
+    attr_accessor :sym
+
+    def initialize(sym)
+      @sym = sym
+    end
+
+    def to_s
+      @sym.to_s
+    end
+
+    def ==(other)
+      true
+    end
+  end
+end

data/lib/rbprolog/version.rb

@@ -0,0 +1,3 @@
+module Rbprolog
+  VERSION = "0.0.1"
+end

data/lib/rbprolog.rb

@@ -0,0 +1,67 @@
+require_relative "rbprolog/version"
+require_relative 'rbprolog/context'
+require_relative 'rbprolog/rule'
+require_relative 'rbprolog/deduction'
+require_relative 'rbprolog/var'
+
+module Rbprolog
+  def self.included(mod)
+    class << mod
+      attr_accessor :rules, :syms
+
+      include ClassMethods
+    end
+  end
+
+  def initialize(&block)
+    instance_eval(&block) if block
+  end
+
+  def rules
+    self.class.rules + (@rules || [])
+  end
+
+  module ClassMethods
+    def keywords(*syms)
+      raise if syms.any? {|sym| sym.to_s.end_with? '?'}
+
+      self.syms ||= []
+      self.syms.concat(syms)
+    end
+
+    def const_missing(sym)
+      Var.new(sym)
+    end
+
+    def method_missing(sym, *args)
+      if self.syms.include? sym
+        Hash === args.last ? rule(sym, *args) : rule(sym, *args, :if => [])
+      elsif self.syms.include? sym.to_s.chomp('?').to_sym
+        Deduction.new(self, sym.to_s.chomp('?').to_sym, *args)
+      else
+        super
+      end
+    end
+
+    def rule(sym, *args, options)
+      self.rules ||= []
+      self.rules << Rule.new(sym, *args, options[:if])
+
+      unless method_defined?(sym)
+        #FIXME only allow fact for now
+        define_method(sym) do |*args|
+          @rules ||= []
+          @rules << Rule.new(sym, *args, [])
+        end
+
+        define_method("#{sym}!") do |*args|
+          Deduction.new(self, sym, *args)
+        end
+
+        define_method("#{sym}?") do |*args|
+          self.send("#{sym}!", *args).any? {|hash| true}
+        end
+      end
+    end
+  end
+end

data/rbprolog.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'rbprolog/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "rbprolog"
+  spec.version       = Rbprolog::VERSION
+  spec.authors       = ["ruijia.li"]
+  spec.email         = ["ruijia.li@gmail.com"]
+  spec.description   = %q{A ruby implementation to simulate prolog partially}
+  spec.summary       = %q{A prolog DSL in ruby to do AI logic analysis}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+end

data/test/test_rbprolog.rb

@@ -0,0 +1,36 @@
+require 'test/unit'
+require_relative '../lib/rbprolog'
+
+class FriendLogic
+  include Rbprolog
+
+  keywords :likes, :friends
+
+  likes 'p1', 's1'
+  likes 'p1', 's2'
+  likes 'p2', 's2'
+  likes 'p3', 's1'
+  likes 'p4', X
+
+  friends 'p1', W, :if => likes?(W, 's2')
+  friends X, Y, :if => [likes?(X, Z), likes?(Y, Z)]
+end
+
+class TestRbprolog < Test::Unit::TestCase
+  def test_friend_logic
+    l = FriendLogic.new do
+      likes 'p5', 's1'
+    end
+
+    assert_equal true, l.likes?('p1', 's1')
+    assert_equal true, l.likes?('p1', 's2')
+    assert_equal true, l.friends?('p1', 'p2')
+    assert_equal true, l.friends?('p1', 'p3')
+    assert_equal true, l.friends?('p1', 'p4')
+    assert_equal false, l.friends?('p1', 'p6')
+    assert_equal true, l.likes?('p5', 's1')
+
+    assert_equal ['s1', 's2'], l.likes!('p1', Rbprolog::Var.new(:X)).map {|hash| hash[:X]}.uniq
+    assert_equal ['p1', 'p2', 'p3', 'p4', 'p5'], l.friends!('p1', Rbprolog::Var.new(:W)).map {|hash| hash[:W]}.uniq.sort
+  end
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification
+name: rbprolog
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- ruijia.li
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-07-27 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  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: A ruby implementation to simulate prolog partially
+email:
+- ruijia.li@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/rbprolog.rb
+- lib/rbprolog/context.rb
+- lib/rbprolog/deduction.rb
+- lib/rbprolog/rule.rb
+- lib/rbprolog/var.rb
+- lib/rbprolog/version.rb
+- rbprolog.gemspec
+- test/test_rbprolog.rb
+homepage: ''
+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.0.6
+signing_key: 
+specification_version: 4
+summary: A prolog DSL in ruby to do AI logic analysis
+test_files:
+- test/test_rbprolog.rb