dmiles-wc: Tryout basicly working.. been a while since chumped
dmiles-wc: Uses OpenCyc and Jamud to allow inference on Role-playing game
dmiles-wc: Telnet interface[telnet://12.255.207.235:8808]
dmiles-wc: Web interfacehttp://12.255.207.235/logicmoo
dmiles-wc: Uses OpenCyc and Jamud to allow inference on Role-playing game
dmiles-wc: Telnet interface[telnet://12.255.207.235:8808]
dmiles-wc: Web interfacehttp://12.255.207.235/logicmoo
Seth: R. V. Guha scores again !
bijan: "We present a new framework for amalgamating two successful programming paradigms: logic programming and object-oriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their internal state during the computation; (ii) the structured representation of knowledge, generally obtained via inheritance graphs among classes of objects
bijan: Still looking for the paper I can't find. But look at all the stuff I'm finding along the way! :)
bijan: Still looking for the paper I can't find. But look at all the stuff I'm finding along the way! :)
bijan: Should be read, I'll bet, by all the intuitionist fetishists working with N3.
bijan: "Some recent works rely on the intuitionistic theory of Hereditary Harrop formulas to provide extensions for Horn clauses while preserving the logic paradigm." Always a good thing, I think. I lik my Hereditary Harrop formulas shaken, not stirred.
bijan: "In particular, an intuitionistic implication is used to provide some form of scoping. However the lack of appropriate evaluation strategies, notably a strategy relying on a forward-chaining search, has limited its application. " Hmm. Sounds familar.
bijan: "This paper investigates a resolution schema for propositional Hereditary Harrop formulas, extending the resolution for Horn Clauses. A particular restriction of this resolution schema provides a specification of bottom-up search in presence of embedded intuitionistic implications." Yay! Academe saves the day!
bijan: "Some recent works rely on the intuitionistic theory of Hereditary Harrop formulas to provide extensions for Horn clauses while preserving the logic paradigm." Always a good thing, I think. I lik my Hereditary Harrop formulas shaken, not stirred.
bijan: "In particular, an intuitionistic implication is used to provide some form of scoping. However the lack of appropriate evaluation strategies, notably a strategy relying on a forward-chaining search, has limited its application. " Hmm. Sounds familar.
bijan: "This paper investigates a resolution schema for propositional Hereditary Harrop formulas, extending the resolution for Horn Clauses. A particular restriction of this resolution schema provides a specification of bottom-up search in presence of embedded intuitionistic implications." Yay! Academe saves the day!
bijan: How's that for an off-panting title? :)
bijan: And it's only the extended abstract!
bijan: And it's only the extended abstract!
danbri__: Chumped so I can find it again when I get back to coding. And cos I'm wondering if it makes sense to anyone else...
danbri__: Seems to be windows only and no sign of source, but output is pretty impressive
danbri__: We were discussing image metadata tools, specifically for generating rdfweb/codepiction SVG paths that outline people in photos.
danbri__: We were discussing image metadata tools, specifically for generating rdfweb/codepiction SVG paths that outline people in photos.
jhendler: question to wrestle with - can we make Parka-DB into a backend for RDF triple stores?
bijan: Preliminary findings: yes.
bijan: Tricky bit #1: A lot of RDF involves large numbers of generated predicaties, i.e., from rdf:lis. (See the chat logs for #rdfig for example...one day can have over 400...or even over 1000!)
bijan: But traditional large scale KBs tend to have small numbers of predicates, and thus optimize for them, or have hard limits.
bijan: Using DAML lists can help. I have a few other tricks. And dajobe mentioned a rdf:li supertype/class that RDF Core is working on, or something.
bijan: (DAML lists help because you use daml:first and daml:rest, rather than a genided predicate for each element in the list. Essentially, cons cells vs. integer indexs for arrays.)
bijan: Preliminary findings: yes.
bijan: Tricky bit #1: A lot of RDF involves large numbers of generated predicaties, i.e., from rdf:lis. (See the chat logs for #rdfig for example...one day can have over 400...or even over 1000!)
bijan: But traditional large scale KBs tend to have small numbers of predicates, and thus optimize for them, or have hard limits.
bijan: Using DAML lists can help. I have a few other tricks. And dajobe mentioned a rdf:li supertype/class that RDF Core is working on, or something.
bijan: (DAML lists help because you use daml:first and daml:rest, rather than a genided predicate for each element in the list. Essentially, cons cells vs. integer indexs for arrays.)
danbri__: Edges are photos; this isn't _really_ RDF, though derrived from harvested RDF. From libby and damian's tools.
danbri__: Sure...
bijan: At this point, anything other than what you've got :) At least eliminate overlapping nodes.
danbri__: It's from RDFAuthor, damian has a button that jiggles the graph a bit, and generally prettifies it. I didn't press it many times.