Tripoli

Status: Alpha

Brought to you by: domfox

Add a Review

Downloads: 0 This Week

Last Update: 2013-03-08

Download

Add to Preferred Sources

Implementation of a Triple Space, a kind of Tuple Space with triples that can be queried for graphs of related triples as well as for triples matching a given pattern.

Project Activity

See All Activity >

License

GNU General Public License version 2.0 (GPLv2)

Follow Tripoli

Tripoli Web Site

Other Useful Business Software

Veeam Data Platform v13.1 - Get Your Free Trial

Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.

Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.

Try it Free

Rate This Project

User Reviews

Be the first to post a review of Tripoli!

Additional Project Details

Programming Language

Python

Registered

2005-04-27

Report inappropriate content

Build Agents and Models on One Platform

Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.

Start Free

Recommended Projects

Vogon
Vogon is a Ontology-based text annotation tool for creating relations between terms in a text. This relations can then be exported as RDF triples.
TinyCog
Cognitive architecture with a focus on self-models
polyester
Polyester is a tuple space framework based on the lighTS project, with extensions to support asynchronous and decoupled interaction of agents. The provided example application is a (toy) library of XML documents that can be queried using XPath.
Tuple Spaces
Tuple space with time outs and transactions.
Slicing-by-8
This distribution contains a novel fast CRC generation algorithm developed by Intel. This algorithm runs at under 3 cycles per byte (vs. 7) and thus triples the performance of existing CRC implementations. Slicing-by-8 uses an 8KB cache footprint.